#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  pair<long long, long long> a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  long long mx = 0, mx_start = 0, mx_end = 0;
  long long j;
  long long mn = n;
  for (long long i = 0; i < n; i++) {
    long long c = a[i].second;
    long long d, ck = 0;
    for (j = i; j < n; j++) {
      if (a[i].first != a[j].first) {
        d = a[j - 1].second;
        break;
      } else
        ck++;
    }
    if (j == n) {
      d = a[j - 1].second;
      i = n - 1;
    } else
      i = j - 1;
    if (ck > mx) {
      mx = ck;
      mx_start = c;
      mx_end = d;
      mn = d - c + 1;
    } else if (ck == mx && (d - c + 1) < mn) {
      mx = ck;
      mx_start = c;
      mx_end = d;
      mn = d - c + 1;
    }
  }
  cout << mx_start << ' ' << mx_end << endl;
  return 0;
}
