#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, i, k, j, h, c, l = 0, p = 0;
  cin >> n;
  vector<int> v, t;
  for (i = 0; i < n; i++) {
    cin >> k;
    v.push_back(k);
  }
  p = abs(v[0] - v[n - 1]);
  h = 0;
  c = n - 1;
  l = p;
  for (i = 1; i < n; i++) {
    p = abs(v[i] - v[i - 1]);
    if (p < l) {
      l = p;
      h = i;
      c = i - 1;
    }
  }
  printf("%d %d", h + 1, c + 1);
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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, i, k, j, h, c, l = 0, p = 0;
  cin >> n;
  vector<int> v, t;
  for (i = 0; i < n; i++) {
    cin >> k;
    v.push_back(k);
  }
  p = abs(v[0] - v[n - 1]);
  h = 0;
  c = n - 1;
  l = p;
  for (i = 1; i < n; i++) {
    p = abs(v[i] - v[i - 1]);
    if (p < l) {
      l = p;
      h = i;
      c = i - 1;
    }
  }
  printf("%d %d", h + 1, c + 1);
}

```