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 INF = (int)2e9;
const double EPS = (double)1e-9;
const double PI = (double)acos(-1.0);
const long long MOD = (long long)1e9 + 7;
void base() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
int main() {
  int n, arr[100005];
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int a, b, k, smallest = INF;
  for (int i = 0; i < n; i++) {
    if (i == n - 1)
      k = 0;
    else
      k = i + 1;
    if (smallest > abs(arr[i] - arr[k])) {
      smallest = abs(arr[i] - arr[k]);
      a = i, b = k;
    }
  }
  cout << 1 + a << " " << b + 1 << endl;
  return 0;
}
