Given is a positive integer $k$. There are $n$ points chosen on a line, such the distance between any two adjacent points is the same. The points are colored in $k$ colors. For each pair of monochromatic points such that there are no points of the same color between them, we record the distance between these two points. If all distances are distinct, find the largest possible $n$.