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

# In[204]:


# # n = int(input())
# # line = list(map(int, input().split()))
# # line = list(str(input()))


# In[20]:


n = int(input())
line = list(map(int, input().split()))


# In[21]:


min_dist = max(line) * 2
pair = [0, 0]

for i in range(n):
    if i == (n-1):
        diff = abs(line[0] - line[i])
        if diff < min_dist:
            pair = [1, n]
    else:
        diff = abs(line[i+1] - line[i])
        if diff < min_dist:
            min_dist = diff
            pair = [i+1,i+2]


ans = " ".join(list(map(str, pair)))
print(ans)


# In[ ]:





# In[ ]:




