#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n, a[N], fi[N], ls[N], d[N];
int main() {
  scanf("%d", &n);
  for (int i = (int)1; i <= (int)n; ++i) scanf("%d", a + i);
  for (int i = (int)1; i <= (int)n; ++i) d[a[i]]++, ls[a[i]] = i;
  for (int i = (int)n; i >= (int)1; --i) fi[a[i]] = i;
  int maxx = 0, ans = 1e9, ans_i, ans_j;
  for (int i = (int)1; i <= (int)N - 10; ++i) maxx = max(d[i], maxx);
  for (int i = (int)1; i <= (int)N - 10; ++i)
    if (d[i] == maxx && fi[i] != 0 && ls[i] - fi[i] + 1 < ans)
      ans = ls[i] - fi[i] + 1, ans_i = fi[i], ans_j = ls[i];
  cout << ans_i << ' ' << ans_j;
  return 0;
}
