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 main() {
  int n;
  cin >> n;
  vector<int> v(n + 1);
  vector<int> diff(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  v[n] = v[0];
  for (int i = 0; i < n; i++) diff[i] = abs(v[i] - v[i + 1]);
  int i = min_element(diff.begin(), diff.end()) - diff.begin();
  int f = i + 1 == n ? n : (i + 1) % n;
  int s = i + 2 == n ? n : (i + 2) % n;
  cout << f << " " << s;
  return 0;
}
