Let nn be an odd integer greater than 1, and let k1,k2,,knk_1, k_2, \ldots, k_n be given integers. For each of the n!n! permutations a=(a1,a2,,an)a = (a_1, a_2, \ldots, a_n) of 1,2,,n1, 2, \ldots, n, let

S(a)=i=1nkiai.S(a) = \sum_{i=1}^{n} k_i a_i.

Prove that there are two permutations bb and c,bcc, b \neq c, such that n!n! is a divisor of S(b)S(c)S(b) - S(c).