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>
int num[111], n;
int main() {
  int i, j, k;
  while (~scanf("%d", &n)) {
    for (i = 0; i < n; i++) {
      scanf("%d", &num[i]);
    }
    k = 1111;
    j = -1;
    for (i = 0; i < n - 1; i++) {
      if (abs(num[i + 1] - num[i]) < k) {
        k = abs(num[i + 1] - num[i]);
        j = i;
      }
    }
    if (abs(num[n - 1] - num[0]) < k) {
      printf("%d 1\n", n);
      continue;
    }
    printf("%d %d\n", j + 1, j + 2);
  }
  return 0;
}
