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() {
  vector<int> v;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  v[n] = v[0];
  int min = 0, f;
  min = abs(v[1] - v[0]);
  int ans1 = 0, ans2 = 0, c = 0;
  for (int i = 0; i < n; i++) {
    f = abs(v[i + 1] - v[i]);
    if (f <= min) {
      min = f;
      ans1 = i;
      ans2 = i + 1;
    }
  }
  ans1++;
  ans2++;
  if (ans1 == n && ans2 == n + 1)
    cout << n << " "
         << "1" << endl;
  else
    cout << ans1 << " " << ans2 << endl;
  return 0;
}
