#include <bits/stdc++.h>
using namespace std;
struct Sol {
  int dif;
  int num;
};
int n, ans = 99999999;
int height[105];
Sol Man[105];
int sum = n - 1;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> height[i];
  for (int i = 0; i < n; i++) {
    Man[i].dif = abs(height[(i + 1) % n] - height[i]);
    ans = min(ans, Man[i].dif);
  }
  for (int i = 0; i < n; i++)
    if (ans == Man[i].dif) {
      int cnt = i + 2;
      if (cnt > n) cnt %= n;
      cout << i + 1 << " " << cnt;
      break;
    }
  return 0;
}
