Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array consisting of $*n*$ elements. Petya is now wondering whether he can swap any two distinct integers in the array so that the array got unsorted. Please note that Petya can not swap equal integers even if they are in distinct positions in the array. Also note that Petya must swap some two integers even if the original array meets all requirements.

Array $*a*$ (the array elements are indexed from 1) consisting of $*n*$ elements is called sorted if it meets at least one of the following two conditions:

1. $*a*_{1} ≤ *a*_{2} ≤ ... ≤ *a*_{*n*}$;
2. $*a*_{1} ≥ *a*_{2} ≥ ... ≥ *a*_{*n*}$.

Help Petya find the two required positions to swap or else say that they do not exist.

Input

The first line contains a single integer $*n*$ ($1 ≤ *n* ≤ 10^{5}$). The second line contains $*n*$ non-negative space-separated integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ — the elements of the array that Petya's mother presented him. All integers in the input do not exceed $10^{9}$.

Output

If there is a pair of positions that make the array unsorted if swapped, then print the numbers of these positions separated by a space. If there are several pairs of positions, print any of them. If such pair does not exist, print -1. The positions in the array are numbered with integers from $1$ to $*n*$.

Note

In the first two samples the required pairs obviously don't exist.

In the third sample you can swap the first two elements. After that the array will look like this: 2 1 3 4. This array is unsorted.