Algorithm

A. Reconnaissance 2
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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
Copy
`510 12 13 15 10`
output
Copy
`5 1`
input
Copy
`410 20 30 40`
output
Copy
`1 2`

Code Examples

#1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <bits/stdc++.h>

using namespace std;

int const N = 1e2 + 1;
int n, a[N];

int main() {
scanf("%d", &n);
for(int i = 0; i < n; ++i)
scanf("%d", a + i);

int mn = 1e9 + 1, k, l;
for(int i = 0; i < n; ++i)
if(abs(a[i] - a[(i + 1) % n]) < mn) {
mn = abs(a[i] - a[(i + 1) % n]);
k = i;
l = (i + 1) % n;
}

printf("%d %d\n", k + 1, l + 1);

return 0;
}``````
Copy The Code &

Input

cmd
5
10 12 13 15 10

Output

cmd
5 1