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 abs(int i) {
  if (i > 0)
    return i;
  else
    return -i;
}
int main() {
  int n;
  int min;
  int height1;
  int ans;
  scanf("%d", &n);
  scanf("%d", &height1);
  int heightNow = height1;
  int heightThan;
  min = 10000;
  for (int i = 2; i <= n; i++) {
    scanf("%d", &heightThan);
    int a = abs(heightThan - heightNow);
    if (min > a) {
      min = a;
      ans = i;
    }
    heightNow = heightThan;
  }
  int a = abs(heightThan - height1);
  if (min > a) {
    printf("1 %d\n", n);
    return 0;
  }
  printf("%d %d\n", ans - 1, ans);
  return 0;
}
