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(void) {
  int amountof_soldier;
  cin >> amountof_soldier;
  int soldier_heights[amountof_soldier];
  for (int i = 0; i < amountof_soldier; i++) {
    cin >> soldier_heights[i];
  }
  int min_heightdiff = abs(soldier_heights[0] - soldier_heights[1]);
  for (int i = 1; i < (amountof_soldier - 1); ++i) {
    if (abs(soldier_heights[i] - soldier_heights[i + 1]) < min_heightdiff) {
      min_heightdiff = abs(soldier_heights[i] - soldier_heights[i + 1]);
    }
  }
  if (min_heightdiff <
      abs(soldier_heights[0] - soldier_heights[amountof_soldier - 1])) {
    for (int i = 0; i < (amountof_soldier - 1); ++i) {
      if (abs(soldier_heights[i] - soldier_heights[i + 1]) == min_heightdiff) {
        cout << (i + 1) << " " << (i + 2) << endl;
        break;
      }
    }
  } else if (min_heightdiff >=
             abs(soldier_heights[0] - soldier_heights[amountof_soldier - 1])) {
    cout << 1 << " " << amountof_soldier << endl;
  }
  return 0;
}
