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 *l;
  int n;
  cin >> n;
  l = new int[n];
  for (int i = 0; i < n; i++) cin >> l[i];
  int min = 0;
  for (int i = 1; i < n - 1; i++)
    if (abs(l[i + 1] - l[i]) < abs(l[min + 1] - l[min])) min = i;
  if (abs(l[0] - l[n - 1]) < abs(l[min + 1] - l[min]))
    cout << "1 " << n;
  else
    cout << min + 1 << " " << min + 2;
  return 0;
}
