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;
  cin >> n;
  int ar[n];
  for (int i = 0; i < n; i++) cin >> ar[i];
  int ar1[n][3], dif;
  for (int i = 0; i < n - 1; i++) {
    dif = abs(ar[i] - ar[i + 1]);
    ar1[i][0] = dif;
    ar1[i][1] = i;
    ar1[i][2] = i + 1;
  }
  ar1[n - 1][0] = abs(ar[0] - ar[n - 1]);
  ar1[n - 1][1] = n - 1;
  ar1[n - 1][2] = 0;
  int minindex = 0;
  for (int i = 1; i < n; i++) {
    if (ar1[i][0] < ar1[minindex][0]) {
      minindex = i;
    }
  }
  cout << ar1[minindex][1] + 1 << " " << ar1[minindex][2] + 1;
}
