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() {
  int n;
  scanf("%d", &n);
  int* s = new int[n];
  for (int i = 0; i < n; i++) scanf("%d", &s[i]);
  vector<int> ne;
  ne.push_back(abs(s[0] - s[n - 1]));
  for (int i = 0, j = 1; j < n; i++, j++) ne.push_back(abs(s[i] - s[j]));
  int min = ne[0];
  for (int m = 1; m < ne.size(); m++)
    if (ne[m] < min) min = ne[m];
  int k;
  for (k = 0; k < ne.size(); k++)
    if (ne[k] == min) break;
  int first = k, second = k + 1;
  if (k == 0) {
    first = 1, second = n;
  }
  printf("%d %d\n", first, second);
}
