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 solve() {
  long long n, i, j, min;
  cin >> n;
  vector<long long> v;
  vector<pair<long long, pair<long long, long long>>> h;
  for (i = 0; i < n; i++) {
    cin >> j;
    v.push_back(j);
  }
  for (i = 0; i < n - 1; i++) {
    h.push_back(make_pair(abs(v[i + 1] - v[i]), make_pair(i + 1, i + 2)));
  }
  h.push_back(make_pair(abs(v[i] - v[0]), make_pair(1, n)));
  sort(h.begin(), h.end());
  cout << h[0].second.first << " " << h[0].second.second;
  return 0;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) solve();
  return 0;
}
