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;
vector<int> army;
int main() {
  int n, z;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> z;
    army.push_back(z);
  }
  int x, y;
  int min = 100000;
  for (int i = 0; i < n; ++i) {
    for (int j = 1; j < n; ++j) {
      if (i == j) continue;
      if ((i == j + 1) || (i == j - 1) || (j == i + 1) || (j == j - 1) ||
          ((i == 0) && (j == n - 1))) {
        if (abs(army[i] - army[j]) < min) {
          min = abs(army[i] - army[j]);
          x = i + 1;
          y = j + 1;
        }
      }
    }
  }
  cout << x << " " << y;
  return 0;
}
