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;
const int N = 1e3 + 9, M = 2e4 + 9, OO = 0x3f3f3f3f;
int main() {
  int n, fnum = 0, snum = 0, dif = 9999;
  cin >> n;
  int arr[101];
  for (int i = 0; i < (int)(n); ++i) {
    cin >> arr[i];
  }
  for (int i = 0; i < n; i++) {
    if (dif > abs(arr[i] - arr[i + 1])) {
      dif = abs(arr[i] - arr[i + 1]);
      fnum = i + 1, snum = i + 2;
    }
    if (abs(arr[0] - arr[n - 1]) < dif) {
      dif = abs(arr[0] - arr[n - 1]);
      fnum = 1, snum = n;
    }
  }
  cout << fnum << " " << snum << endl;
}
