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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int nofsoldiers{0}, posf{0}, posfi{0};
  ;
  cin >> nofsoldiers;
  int form[nofsoldiers];
  for (int i = 0; i < nofsoldiers; i++) {
    cin >> form[i];
  }
  int min = abs(form[0] - form[1]);
  for (int i = 0; i < nofsoldiers - 1; i++) {
    int diff = abs(form[i] - form[i + 1]);
    if (diff <= min) {
      min = diff;
      posf = i + 1;
      posfi = posf + 1;
    }
  }
  if (abs(form[0] - form[nofsoldiers - 1]) <= min) {
    min = abs(form[0] - form[nofsoldiers - 1]);
    posf = nofsoldiers;
    posfi = 1;
  }
  cout << posf << " " << posfi << "\n";
  return 0;
}
