Reframed questions:

1. Consider 2 sequences, (x_1,x_2...,x_k) and (y_1,y_2,...,y_k) which are unordered

and different. From these two sequences we can generate 2 sequences, such that,
(x_i+x_j), for all 1<=i<j<=k and (y_i+y_j), for all 1<=i<j<=k.
Now what can be the highest value of k (<1000) such that a permutation of (x_i+x_j)
coincide with (y_i+y_j).

Ans: 512.