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 python
# -*- coding: utf-8 -*-

def main():
    n = int(raw_input())
    l = zip(map(int, raw_input().split()), xrange(1, n+1))
    l.append(l[0])
    t = (10000, 0, 0)
    for i in xrange(n):
        if abs(l[i][0] - l[i+1][0]) < t[0]:
            t = (abs(l[i][0] - l[i+1][0]), l[i][1], l[i+1][1])
    print t[1], t[2]
    return 0

if __name__ == '__main__':
    main()
