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>
using namespace std;
long long n, x, y, i = 0, j = 0, a, b, c = 0, t = 0, sum = 0, z = 0, f = 0,
                   df[1000][1000], color[10000], d[10000];
string s;
int main() {
  cin >> n;
  int a[n], b[n];
  for (int i = 0; i <= n - 1; i++) {
    cin >> a[i];
  }
  for (int i = 0; i <= n - 1; i++) {
    if (i != n - 1)
      b[i] = abs(a[i] - a[i + 1]);
    else
      b[i] = abs(a[i] - a[0]);
  }
  t = 1e9;
  for (int i = 0; i <= n - 1; i++) {
    if (b[i] < t) {
      c = i;
      t = b[i];
    }
  }
  if (c == n - 1)
    cout << 1 << " " << n;
  else
    cout << c + 1 << " " << c + 2;
  return 0;
}
