Let n>6n > 6 be an integer and a1,a2,,aka_1, a_2, \ldots, a_k be all the natural numbers less than nn and relatively prime to nn. If

a2a1=a3a2==akak1>0,a_2 - a_1 = a_3 - a_2 = \cdots = a_k - a_{k-1} > 0,

prove that nn must be either a prime number or a power of 2.