Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Amr and The Large Array

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAmr has got a large array of size *n*. Amr doesn't like large arrays so he intends to make it smaller.

Amr doesn't care about anything in the array except the beauty of it. The beauty of the array is defined to be the maximum number of times that some number occurs in this array. He wants to choose the smallest subsegment of this array such that the beauty of it will be the same as the original array.

Help Amr by choosing the smallest subsegment possible.

Input

The first line contains one number *n* (1 ≤ *n* ≤ 10^{5}), the size of the array.

The second line contains *n* integers *a*_{i} (1 ≤ *a*_{i} ≤ 10^{6}), representing elements of the array.

Output

Output two integers *l*, *r* (1 ≤ *l* ≤ *r* ≤ *n*), the beginning and the end of the subsegment chosen respectively.

If there are several possible answers you may output any of them.

Examples

Input

5

1 1 2 2 1

Output

1 5

Input

5

1 2 2 3 1

Output

2 3

Input

6

1 2 2 1 1 2

Output

1 5

Note

A subsegment *B* of an array *A* from *l* to *r* is an array of size *r* - *l* + 1 where *B*_{i} = *A*_{l + i - 1} for all 1 ≤ *i* ≤ *r* - *l* + 1

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/26/2018 06:46:19 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|