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, s[10001], ss[10001];
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &s[i]);
  for (int i = 1; i < n; i++) {
    ss[i] = abs(s[i] - s[i + 1]);
  }
  ss[n] = abs(s[n] - s[1]);
  int t, min = 999999;
  for (int i = 1; i <= n; i++) {
    if (min > ss[i]) {
      min = ss[i];
      t = i;
    }
  }
  if (t != n)
    printf("%d %d\n", t, t + 1);
  else
    printf("%d %d\n", t, 1);
  return 0;
}
