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> mas;
int main() {
  int n;
  cin >> n;
  mas.resize(n);
  for (int i = 0; i < n; ++i) scanf("%d", &mas[i]);
  mas.push_back(mas[0]);
  int best = -1, it1, it2;
  for (int i = 0; i < n; ++i)
    if (best == -1 ||
        best > ((mas[i] - mas[i + 1] < 0) ? -(mas[i] - mas[i + 1])
                                          : mas[i] - mas[i + 1])) {
      best = ((mas[i] - mas[i + 1] < 0) ? -(mas[i] - mas[i + 1])
                                        : mas[i] - mas[i + 1]);
      it1 = i + 1;
      it2 = i + 2;
    }
  if (it2 == n + 1) it2 = 1;
  cout << it1 << " " << it2 << endl;
  return 0;
}
