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;
int main() {
  int n, d, i, j, h, a, b, t;
  vector<int> m;
  while (scanf("%d", &n) == 1) {
    m.clear();
    a = 0;
    b = 0;
    for (i = 0; i < n; i++) {
      cin >> h;
      m.push_back(h);
    }
    t = 1000;
    for (j = 1; j < n; j++) {
      d = abs(m[j] - m[j - 1]);
      if (d < t) {
        t = d;
        a = j;
        b = a + 1;
      }
    }
    d = abs(m[n - 1] - m[0]);
    if (d < t) {
      t = d;
      a = n;
      b = 1;
    }
    cout << a << " " << b << endl;
  }
  return 0;
}
