#include <bits/stdc++.h>
using namespace std;
int a[105];
int diff(int a, int b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
int main() {
  int n, min = 10000, i, t1, t2;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    if (i > 0) {
      if (diff(a[i], a[i - 1]) < min) {
        min = diff(a[i], a[i - 1]);
        t1 = i + 1;
        t2 = i;
      }
    }
  }
  if (diff(a[0], a[n - 1]) < min) {
    min = diff(a[0], a[n - 1]);
    t1 = 1;
    t2 = n;
  }
  cout << t1 << " " << t2;
}

### Prompt

Generate 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 a[105];
int diff(int a, int b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
int main() {
  int n, min = 10000, i, t1, t2;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    if (i > 0) {
      if (diff(a[i], a[i - 1]) < min) {
        min = diff(a[i], a[i - 1]);
        t1 = i + 1;
        t2 = i;
      }
    }
  }
  if (diff(a[0], a[n - 1]) < min) {
    min = diff(a[0], a[n - 1]);
    t1 = 1;
    t2 = n;
  }
  cout << t1 << " " << t2;
}

```