#include <bits/stdc++.h>
using namespace std;
long long qp(long long a, long long b, long long mod) {
  long long t = 1;
  while (b) {
    if (b & 1) t = t * a % mod;
    b >>= 1;
    a = a * a % mod;
  }
  return t;
}
struct DOT {
  int x;
  int y;
};
inline void read(int &x) {
  int k = 0;
  char f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) k = k * 10 + c - '0';
  x = k * f;
}
void ex() {
  puts("No");
  exit(0);
}
const int dx[4] = {0, 0, -1, 1};
const int dy[4] = {1, -1, 0, 0};
const int inf = 0x3f3f3f3f;
const long long Linf = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
;
const int maxn = 1e5 + 34;
int n, a[maxn];
map<int, int> cnt;
map<int, int> lb, rb;
int main() {
  scanf("%d", &n);
  int mx = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    cnt[a[i]]++;
    mx = max(mx, cnt[a[i]]);
    if (cnt[a[i]] == 1) {
      lb[a[i]] = i;
    }
    rb[a[i]] = i;
  }
  int ans = n;
  int ansl = 1;
  map<int, int>::iterator it;
  for (it = cnt.begin(); it != cnt.end(); it++) {
    if (it->second == mx) {
      int tmp = rb[it->first] - lb[it->first] + 1;
      if (ans > tmp) {
        ans = tmp;
        ansl = lb[it->first];
      }
    }
  }
  printf("%d %d\n", ansl, ansl + ans - 1);
}
