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

 # ///==========Libraries, Constants and Functions=============///
#mkraghav
import sys

inf = float("inf")
mod = 1000000007


def get_array(): return list(map(int, sys.stdin.readline().split()))


def get_ints(): return map(int, sys.stdin.readline().split())


def input(): return sys.stdin.readline()

def int1():return int(input())

import string

import math


from itertools import combinations
# ///==========MAIN=============///


def main():
    x=0
    y=0
    m=1000000000
    i=0
    n=int1()
    a=get_array()
    while i<n:
        if i !=n-1:
            if abs(a[i]-a[i+1])<m:

                x=i+1
                y=i+2
                m=abs(a[i]-a[i+1])
        if i==n-1:
            if abs(a[n-1]-a[0])<m:
                m=abs(a[n-1]-a[0])
                x=n
                y=1

        i=i+1
    print(x,y)























if __name__ == "__main__":
    main()
