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;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long ind1 = 0, ind2 = 0, min = 1001, res;
  for (long long j = 0; j + 1 < n; j++) {
    res = a[j + 1] > a[j] ? a[j + 1] - a[j] : a[j] - a[j + 1];
    if (res < min) {
      min = res;
      ind1 = j + 1;
      ind2 = j + 2;
    }
  }
  res = a[n - 1] > a[n - n] ? a[n - 1] - a[n - n] : a[n - n] - a[n - 1];
  if (res < min) {
    ind1 = n;
    ind2 = 1;
  }
  cout << ind1 << " " << ind2;
  return 0;
}
