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
class solution:
    def reconnaissance(self,nums):
        n=len(nums)
        if n<2:
            print(0)
        minimal=abs(nums[0]-nums[-1])
        pos=[-1,0]
        iterator=0
        
        while iterator<n:
            if minimal>abs(nums[iterator]-nums[iterator-1]):
                minimal=abs(nums[iterator]-nums[iterator-1])
                pos=[iterator-1,iterator]
            iterator+=1    
        if pos[1]==0:
            print(len(nums),1)
        else:
            print(pos[0]+1,pos[1]+1)
        
n = int(input())
data = list(map(int, input().split()))
solution().reconnaissance(data)