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;
bool sortby(pair<long long, long long> &a, pair<long long, long long> &b) {
  return a.first < b.first;
}
void solve() {
  long long n;
  cin >> n;
  vector<pair<long long, long long> > v;
  for (int i = 0; i < n; i++) {
    long long a;
    cin >> a;
    v.push_back(make_pair(a, i + 1));
  }
  v.push_back(make_pair(v[0].first, 1));
  long long a = 0, b = 0, mini = INT_MAX;
  for (int i = 0; i < n; i++) {
    long long dif = abs(v[i].first - v[i + 1].first);
    if (dif < mini) {
      mini = dif;
      a = v[i].second;
      b = v[i + 1].second;
    }
  }
  cout << a << " " << b;
}
int main() { solve(); }
