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 n, h[300], i, j, min, p, q, temp;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &h[i]);
  temp = h[1] - h[0];
  if (temp < 0) temp = -temp;
  min = temp;
  p = 0;
  q = 1;
  for (i = 0; i < n; i++) {
    j = i + 1;
    if (j == n) j = 0;
    temp = h[i] - h[j];
    if (temp < 0) temp = -temp;
    if (temp < min) {
      min = temp;
      p = i;
      q = j;
    }
  }
  printf("%d %d\n", p + 1, q + 1);
  return 0;
}
