CUSKIJA

문제

Rearrange the given array of integers so that the sum of two adjacent elements is never divisible by three. 

입력

The first line contains an integer N (1 ≤ N ≤ 10000), the number of elements in the array. 

The second line contains the elements of the array separated by single spaces. The elements will be positive integers less than 1000000. 

출력

If any valid rearrangement exists, output it on a single line. Otherwise, output "-1". 

 

3
1 2 3

2 3 1

5
4 6 3 9 8

3 4 6 8 9

6
3 7 6 4 2 8

3 7 4 6 2 8

3
3 12 9

-1