The first line of the input contains the size n of the permutations.
The second contains n signed integers in the range from 1 to n.
If n equals 0 the program terminates.
The output consists of an equivalent simple permutation where the additional elements are
also integers greater than n.
Here is an example:
6
3 2 1 5 -6 -4
Result in the simple permutation:
+3 +2 +1 +5 +9 -6 -8 -7 -4
according to the extended identity permutation
+1 +7 +2 +3 +8 +9 +4 +5 +6
you can relabeling the additional elements in the
extended identity permutation
+1 +1.5 +2 +3 +3.5 +3.75 +4 +5 +6
and the simple permutation
+3 +2 +1 +5 +3.75 -6 -3.5 -1.5 -4