#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, arr[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int fmin = 1000000;
  int ans1, ans2;
  for (int i = 0; i < n; i++) {
    int g = abs(arr[i] - arr[(i + 1) % n]);
    if (g < fmin) {
      fmin = g;
      ans1 = i;
      ans2 = (i + 1) % n;
    }
  }
  cout << ans1 + 1 << " " << ans2 + 1 << '\n';
  return 0;
}

### 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;
const int N = 105;
int n, arr[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int fmin = 1000000;
  int ans1, ans2;
  for (int i = 0; i < n; i++) {
    int g = abs(arr[i] - arr[(i + 1) % n]);
    if (g < fmin) {
      fmin = g;
      ans1 = i;
      ans2 = (i + 1) % n;
    }
  }
  cout << ans1 + 1 << " " << ans2 + 1 << '\n';
  return 0;
}

```