#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int n;
  cin >> n;
  int ar[n + 1], i;
  for (i = 1; i <= n; ++i) cin >> ar[i];
  int x = 1, y = n, Min = abs(ar[1] - ar[n]);
  for (i = 1; i < n; ++i) {
    if (abs(ar[i] - ar[i + 1]) < Min) {
      Min = abs(ar[i] - ar[i + 1]);
      x = i;
      y = i + 1;
    }
  }
  cout << x << " " << y << endl;
  return 0;
}

### Prompt

Your challenge is to write 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(void) {
  int n;
  cin >> n;
  int ar[n + 1], i;
  for (i = 1; i <= n; ++i) cin >> ar[i];
  int x = 1, y = n, Min = abs(ar[1] - ar[n]);
  for (i = 1; i < n; ++i) {
    if (abs(ar[i] - ar[i + 1]) < Min) {
      Min = abs(ar[i] - ar[i + 1]);
      x = i;
      y = i + 1;
    }
  }
  cout << x << " " << y << endl;
  return 0;
}

```