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
from sys import stdin

if __name__=='__main__':
        n=int(stdin.readline().strip())
        #print n
        data=map(int,stdin.readline().split())
        data=data+[data[0]]
        ans=10000000
        idx=0;

        for i,elem in enumerate(data[:-1]):
            cur=abs(elem-data[i+1])
            if cur<ans:
                ans=cur
                idx=i
        print "%d %d\n"%(idx+1,((idx+1)%n)+1)
