Problem: Amr 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 ≤ 105), the size of the array.

The second line contains n integers ai (1 ≤ ai ≤ 106), 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 Bi = Al + i - 1 for all 1 ≤ i ≤ r - l + 1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct point {
  int p, x;
} pt[100007];
int n;
bool cmp(point a, point b) {
  if (a.x == b.x) return a.p < b.p;
  return a.x < b.x;
}
struct node {
  int num, r, l;
} nd[100007];
int cnt = 0;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &pt[i].x);
    pt[i].p = i;
  }
  sort(pt + 1, pt + 1 + n, cmp);
  nd[cnt].l = pt[1].p;
  int sum = 1;
  for (int i = 1; i <= n; i++) {
    if (pt[i].x != pt[i + 1].x) {
      nd[cnt].r = pt[i].p;
      nd[cnt].num = sum;
      nd[++cnt].l = pt[i + 1].p;
      sum = 0;
    }
    sum++;
  }
  int msum = 0;
  for (int i = 0; i < cnt; i++) msum = max(msum, nd[i].num);
  int mlen = n + 1, p = -1;
  for (int i = 0; i < cnt; i++)
    if (msum == nd[i].num)
      if (nd[i].r - nd[i].l < mlen) mlen = nd[i].r - nd[i].l, p = i;
  printf("%d %d\n", nd[p].l, nd[p].r);
}