#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  long long ans = INT_MAX, b, c;
  for (int i = 0; i < n - 1; i++) {
    if (abs(a[i] - a[i + 1]) < ans) {
      ans = abs(a[i] - a[i + 1]);
      b = i;
      c = i + 1;
    }
  }
  if (abs(a[n - 1] - a[0]) < ans) {
    b = 0;
    c = n - 1;
  }
  cout << b + 1 << " " << c + 1;
}

### Prompt

Please formulate a cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  long long ans = INT_MAX, b, c;
  for (int i = 0; i < n - 1; i++) {
    if (abs(a[i] - a[i + 1]) < ans) {
      ans = abs(a[i] - a[i + 1]);
      b = i;
      c = i + 1;
    }
  }
  if (abs(a[n - 1] - a[0]) < ans) {
    b = 0;
    c = n - 1;
  }
  cout << b + 1 << " " << c + 1;
}

```