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 n;
const int maxn = 1002;
int a[maxn];
struct node {
  int x;
  int y;
};
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int minn = 0x3f3f3f3f;
  node t;
  for (int i = 1; i < n; i++) {
    if (fabs(a[i] - a[i + 1]) < minn) {
      t = {i, i + 1};
      minn = min(minn, abs(a[i] - a[i + 1]));
    }
  }
  if (fabs(a[1] - a[n]) < minn) {
    cout << "1"
         << " " << n << endl;
    return 0;
  }
  cout << t.x << " " << t.y << endl;
  return 0;
}
