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
# coding=UTF-8

#import sys

import sys
from math import *

def main():
    inp = sys.stdin.readline().strip()
    n = int(inp)
    inp = sys.stdin.readline().strip()
    heights = inp.split()
    iHeights = map(int, heights)
    
    min = 1001
    minIndex = [0, 0]

    for i in range(0, n-1):
        diff = int(fabs(iHeights[i] - iHeights[i+1]))
        if diff < min:
            min = diff
            minIndex[0] = i+1
            minIndex[1] = i+2
    
    diff = int(fabs(iHeights[0] - iHeights[n-1]))
    if diff < min:
        min = diff
        minIndex[0] = 1
        minIndex[1] = n
        
    pprint(repr(minIndex[0]) + ' ' + repr(minIndex[1]))
            
def pprint(str):
    sys.stdout.write(str)
    return

main()