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 i, j, k;
  int n, diff = 2000;
  int index1, index2;
  scanf("%d", &n);
  int h[n];
  for (i = 0; i < n; i++) {
    scanf("%d", &h[i]);
  }
  for (i = 0; i < n - 1; i++) {
    if (abs(h[i + 1] - h[i]) < diff) {
      diff = abs(h[i + 1] - h[i]);
      index1 = i;
      index2 = i + 1;
    }
  }
  if (abs(h[0] - h[n - 1]) < diff) {
    diff = abs(h[0] - h[n - 1]);
    index1 = 0;
    index2 = n - 1;
  }
  printf("%d %d", index1 + 1, index2 + 1);
}
