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 maxn = 100 + 10;
int n, a[maxn], min_t, x, y;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  min_t = max(a[0], a[1]) - min(a[0], a[1]);
  y = 0;
  x = 1;
  for (int i = 0; i < n; i++)
    if (min_t > max(a[i % n], a[(i + 1) % n]) - min(a[i % n], a[(i + 1) % n])) {
      min_t = max(a[i % n], a[(i + 1) % n]) - min(a[i % n], a[(i + 1) % n]);
      y = i % n;
      x = (i + 1) % n;
    }
  cout << x + 1 << " " << y + 1 << endl;
  return 0;
}
