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;
long long n, ans;
string str;
long long solve() {
  cin >> n;
  long long a[n];
  for (long long i = 0; i <= n - 1; ++i) cin >> a[i];
  long long t = abs(a[0] - a[n - 1]);
  for (long long i = 1; i <= n - 1; ++i) {
    t = min(t, abs(a[i] - a[i - 1]));
  }
  if (t == abs(a[0] - a[n - 1]))
    cout << 1 << " " << n;
  else {
    for (long long i = 1; i <= n - 1; ++i) {
      if (t == abs(a[i] - a[i - 1])) {
        cout << i << " " << i + 1;
        return 0;
      }
    }
  }
  return 0;
}
signed main() {
  ios::sync_with_stdio(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
