#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m[101], i, min, i1, i2;
  cin >> n;
  for (i = 0; i < n; ++i) cin >> m[i];
  min = abs(m[n - 1] - m[0]);
  i1 = n - 1;
  i2 = 0;
  for (i = 1; i < n; ++i)
    if (abs(m[i] - m[i - 1]) < min) {
      min = abs(m[i] - m[i - 1]);
      i1 = i;
      i2 = i - 1;
    }
  cout << i1 + 1 << " " << i2 + 1;
}

### Prompt

Create a solution in Cpp for 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() {
  int n, m[101], i, min, i1, i2;
  cin >> n;
  for (i = 0; i < n; ++i) cin >> m[i];
  min = abs(m[n - 1] - m[0]);
  i1 = n - 1;
  i2 = 0;
  for (i = 1; i < n; ++i)
    if (abs(m[i] - m[i - 1]) < min) {
      min = abs(m[i] - m[i - 1]);
      i1 = i;
      i2 = i - 1;
    }
  cout << i1 + 1 << " " << i2 + 1;
}

```