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 main() {
  int arr[1000], n, i, j, k, counter = 99999999, x, y;
  scanf("%d", &n);
  for (i = 0; i < n; ++i) {
    scanf("%d", &arr[i]);
  }
  for (j = 1; j < n; ++j) {
    for (k = j - 1; k < j; ++k) {
      if (abs(arr[j] - arr[k]) < counter) {
        counter = abs(arr[j] - arr[k]);
        x = j + 1;
        y = k + 1;
      }
    }
  }
  if (abs(arr[0] - arr[n - 1]) < counter) {
    counter = abs(arr[0] - arr[n - 1]);
    x = 1;
    y = n;
  }
  printf("%d %d", y, x);
  return 0;
}
