Gank Botlane

$\mathbb{NUME}$ wants to gank botlane, but first, he has to solve this problem and you need to help him:

Given an array $a$ of $n$ integers, he wants to find a subarray of $a$ in which the sum of elements on odd positions is equal to the sum of elements on even positions. The positions are considered to be the ones from the initial array.

More formally, you need to find $l$ and $r$ such that:

$\displaystyle \sum_{\substack{i = l\\i \text{ odd}}}^r a_i = \sum_{\substack{i = l\\i \text{ even}}}^r a_i$

Help him solve this problem fast so that he can get that double kill.

Input

The first line contains a single integer $n$ ($1 \le n \le 10^5$) – the length of the array $a$.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$).

Output

Print $l$ and $r$ – the indices chosen for the operation.

If there are multiple solutions, print the one that minimizes $l$. If there are multiple solutions that minimize $l$, print the one that minimizes $r$.

If there are no solutions, print $-1$.

Example 1

stdin

7
8 2 3 4 3 1 7

stdout

2 5

Example 2

stdin

4
1 1 1 1

stdout

1 2

Example 3

stdin

5
5 4 3 2 1

stdout

-1