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>
const double EPS = 1e-12;
const long long MAX = 1e6 + 10;
const long long MOD = 1e9 + 7;
using namespace std;
int main() {
  int soldiers;
  cin >> soldiers;
  int heights[100];
  for (int i = 0; i < soldiers; i++) {
    cin >> heights[i];
  }
  int minimum = 2147483647;
  int p1, p2;
  p1 = p2 = 0;
  for (int i = 0; i < soldiers; i++) {
    if (abs(heights[i] - heights[i + 1]) < minimum) {
      p1 = i + 1;
      p2 = i + 2;
      minimum = abs(heights[i] - heights[i + 1]);
    }
  }
  if (abs(heights[0] - heights[soldiers - 1]) < minimum) {
    p1 = 1;
    p2 = soldiers;
  }
  cout << p1 << " " << p2 << endl;
}
