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 n, temp = 0, minimum = 1000000, index = 0;
  scanf("%d", &n);
  int ara[n];
  int trackAra[n];
  for (int i = 0; i < n; i++) {
    scanf("%d", &ara[i]);
  }
  for (int i = 0; i < n - 1; i++) {
    temp = ara[i + 1] - ara[i];
    trackAra[i] = abs(temp);
  }
  temp = ara[n - 1] - ara[0];
  trackAra[n - 1] = abs(temp);
  for (int j = 0; j < n; j++) {
    if (trackAra[j] < minimum) {
      minimum = trackAra[j];
      index = j;
    }
  }
  if (index + 1 == n)
    printf("%d %d", n, 1);
  else
    printf("%d %d", index + 1, index + 2);
  return 0;
}
