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 arr[n], ar[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  int count1 = 0, count2 = 0;
  for (int i = 0; i < n; i++) ar[i] = arr[i];
  sort(ar, ar + n);
  int a, b, fin = 1001;
  int mini = 0;
  mini = abs(arr[0] - arr[n - 1]);
  for (int i = 0; i < n - 1; i++) {
    a = abs(arr[i] - arr[i + 1]);
    mini = min(mini, a);
  }
  for (int i = 0; i < n - 1; i++) {
    if (abs(arr[i] - arr[i + 1]) == mini) {
      count1 = i;
      count2 = i + 1;
    }
  }
  if (count1 == 0 && count2 == 0)
    cout << "1"
         << " " << n << endl;
  else
    cout << count1 + 1 << " " << count2 + 1 << endl;
  return 0;
}
