Darth Vader is positioning his legions of stormtroopers around multiple sites. He has n legions $s_1,$dots,$s_n$ that must be positioned in $n$ sites $0,1,$dots,$n-1,$ one legion per site. Moreover, to maximize evasion, he has positioned his legions so that the distances$/$s$\_2s_1||,s_3-s_2|,..|,s_n-s(n-1)||$ must also be distinct. Luke is trying to recover the exact position of each legion. Can you help him?

Upload your mod file, which should contain a declaration

int $n=$dots;

where $n$ denotes the number of legions.

Define $n$ in your dat file for testing, but only submit the mod file.

Include, in your model, an output of the form

int i in $1..n$ to be filled$>$