Given a circular array A of N elements(the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn't exist, output -1 for this number.
Constraints
1<=N<=104
1<=A[i]<=105
Input
The first line contains N, the following line contains N space separated integers.
Output
Print the next greater number of each element of the array (space separated).
The first 1's next greater number is 2; The number 2 can't find next greater number; The second 1's next greater number needs to search circularly, which is also 2.
