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
#!/usr/bin/env python2
# -*- coding: utf-8 -*-
import sys
input = sys.stdin
output = sys.stdout

def solve(H):
    n = len(H)
    H.append(H[0])
    D = []
    for i in range(n):
        D.append(abs(H[i+1]-H[i]))
    dmin = min(D)
    i = D.index(dmin)
    if i==n-1:
        return n,1
    return i+1,i+2

n = int(input.readline())
assert 2<=n and n<=100

H = [int(s) for s in input.readline().strip().split(' ')]
assert all(1<=h and h<=1000 for h in H)

i,j = solve(H)
output.write('%d %d\n' % (i,j))
