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 n, a[110];
int main() {
  while (cin >> n) {
    for (int i = 0; i < n; i++) cin >> a[i];
    a[n] = a[0];
    int Min = ((a[1] - a[0]) > 0 ? (a[1] - a[0]) : -(a[1] - a[0])), id1 = 0,
        id2 = 1;
    for (int i = 2; i <= n; i++) {
      if (((a[i] - a[i - 1]) > 0 ? (a[i] - a[i - 1]) : -(a[i] - a[i - 1])) <
          Min) {
        Min = ((a[i] - a[i - 1]) > 0 ? (a[i] - a[i - 1]) : -(a[i] - a[i - 1]));
        id1 = i - 1, id2 = i;
      }
    }
    id1++, id2++;
    if (id2 > n) id2 %= n;
    cout << id1 << " " << id2 << endl;
  }
  return 0;
}
