#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a1;
  cin >> n >> a1;
  int prev(a1), cur, reconnaissance(1000), index1, index2;
  for (int i = 2; i <= n; ++i) {
    cin >> cur;
    int diff = abs(cur - prev);
    if (diff < reconnaissance) {
      reconnaissance = diff;
      index1 = i - 1;
      index2 = i;
    }
    prev = cur;
  }
  int diff = abs(a1 - prev);
  if (diff < reconnaissance) {
    index1 = n;
    index2 = 1;
  }
  cout << index1 << " " << index2 << 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() {
  int n, a1;
  cin >> n >> a1;
  int prev(a1), cur, reconnaissance(1000), index1, index2;
  for (int i = 2; i <= n; ++i) {
    cin >> cur;
    int diff = abs(cur - prev);
    if (diff < reconnaissance) {
      reconnaissance = diff;
      index1 = i - 1;
      index2 = i;
    }
    prev = cur;
  }
  int diff = abs(a1 - prev);
  if (diff < reconnaissance) {
    index1 = n;
    index2 = 1;
  }
  cout << index1 << " " << index2 << endl;
  return 0;
}

```