n soldiers stand in a circle. For each soldier his height ai is known. A reconnaissance unit can be made of such two neighbouring soldiers, whose heights difference is minimal, i.e. |ai - aj| is minimal. So each of them will be less noticeable with the other. Output any pair of soldiers that can form a reconnaissance unit.

Input

The first line contains integer n (2 ≤ n ≤ 100) — amount of soldiers. Then follow the heights of the soldiers in their order in the circle — n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 1000). The soldier heights are given in clockwise or counterclockwise direction.

Output

Output two integers — indexes of neighbouring soldiers, who should form a reconnaissance unit. If there are many optimum solutions, output any of them. Remember, that the soldiers stand in a circle.

Examples

Input

5
10 12 13 15 10


Output

5 1


Input

4
10 20 30 40


Output

1 2
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
template <class _T>
inline string tostr(const _T& a) {
  ostringstream os("");
  os << a;
  return os.str();
}
int n, a[200], m;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  m = 100000;
  for (int i = 0; i < n - 1; i++) {
    int s = abs(a[i] - a[i + 1]);
    m = min(s, m);
  }
  m = min(m, abs(a[0] - a[n - 1]));
  for (int i = 0; i < n - 1; i++) {
    if (abs(a[i] - a[i + 1]) == m) {
      cout << i + 1 << " " << i + 2;
      return 0;
    }
  }
  if (abs(a[0] - a[n - 1]) == m) cout << n << " " << 1;
  return 0;
}
