#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
long long pows(long long a, long long n, long long m) {
  long long res = 1;
  while (n) {
    if (n % 2 != 0) {
      res = (res * a) % m;
      n--;
    } else {
      a = (a * a) % m;
      n = n / 2;
    }
  }
  return res % m;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
bool isprime(long long n) {
  if (n == 1) {
    return false;
  }
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
bool istrue(string s) {
  int i = 0;
  int j = s.size() - 1;
  while (i < j) {
    if (s[i] == s[j]) {
      i++;
      j--;
    } else {
      return false;
    }
  }
  return true;
}
int a[1000001];
vector<int> ar[1000001];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  map<int, int> mp;
  int mx = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]]++;
    if (mp[a[i]] > mx) {
      mx = mp[a[i]];
    }
    ar[a[i]].push_back(i);
  }
  if (mx == 1) {
    cout << 1 << " " << 1 << endl;
    return 0;
  }
  int mn = 1000000007;
  int x = -1, y = -1;
  for (auto z : mp) {
    int p = z.first;
    if (z.second == mx) {
      int g = -1, h = -1;
      for (int res : ar[p]) {
        if (g == -1) {
          g = res;
        } else {
          h = res;
        }
      }
      if (abs(h - g) < mn) {
        x = g;
        y = h;
        mn = abs(h - g);
      }
    }
  }
  cout << x + 1 << " " << y + 1 << endl;
}
