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() {
  long long r;
  vector<long long> a;
  cin >> r;
  for (int i = 0; i < r; i++) {
    long long aux;
    cin >> aux;
    a.push_back(aux);
  }
  a.push_back(a[0]);
  long long n = 0, m = 1;
  long long min = abs(a[0] - a[1]);
  for (int i = 1; i < r; i++) {
    if (abs(a[i] - a[i + 1]) < min) {
      n = i % r;
      m = (i + 1) % r;
      min = abs(a[i] - a[i + 1]);
    }
  }
  cout << n + 1 << " " << m + 1;
  return 0;
}
