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;
void readInputData();
void run();
int main(int argc, char** argv) {
  ios_base::sync_with_stdio(false);
  readInputData();
  run();
  return 0;
}
int n;
int a[1001];
void readInputData() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  a[n] = a[0];
}
void run() {
  int i = 0;
  int j = 1;
  for (int k = 1; k < n; ++k)
    if (abs(a[i] - a[j]) > abs(a[k] - a[k + 1])) {
      i = k;
      j = k + 1;
    }
  if (j == n) j = 0;
  cout << i + 1 << ' ' << j + 1 << endl;
}
