You are given a sequence a1, a2, ..., an of one-dimensional segments numbered 1 through n. Your task is to find two distinct indices i and j such that segment ai lies within segment aj.

Segment [l1, r1] lies within segment [l2, r2] iff l1 ≥ l2 and r1 ≤ r2.

Print indices i and j. If there are multiple answers, print any of them. If no answer exists, print -1 -1.

Input

The first line contains one integer n (1 ≤ n ≤ 3·105) — the number of segments.

Each of the next n lines contains two integers li and ri (1 ≤ li ≤ ri ≤ 109) — the i-th segment.

Output

Print two distinct indices i and j such that segment ai lies within segment aj. If there are multiple answers, print any of them. If no answer exists, print -1 -1.

Examples

Input

5
1 10
2 9
3 9
2 3
2 9


Output

2 1


Input

3
1 5
2 6
6 20


Output

-1 -1

Note

In the first example the following pairs are considered correct:

  * (2, 1), (3, 1), (4, 1), (5, 1) — not even touching borders; 
  * (3, 2), (4, 2), (3, 5), (4, 5) — touch one border; 
  * (5, 2), (2, 5) — match exactly. 
n=int(input())
lst=[]

for i in range(n):
    l, r = map(int, input().split())
    lstcur=[l, r]
    lst.append(lstcur)
lsts = sorted(lst)
f=False
maxr = -1
maxl = -1
maxi = -1
if n==1:
    print(-1, -1)
    f = True
for i in range(len(lsts)):
    if f:
        break
    if lsts[i][0] == maxl:
        if lsts[i][1] == maxr:
            print(lst.index([maxl, maxr])+1, end=' ')
            lst[lst.index(lsts[i])] = [-1, -1]
            print(lst.index(lsts[i])+1)
        else:
            print(lst.index([maxl, maxr])+1, lst.index(lsts[i])+1)
        f=True
        break
    if lsts[i][1] == maxr:
        print(lst.index(lsts[i])+1, lst.index([maxl, maxr])+1)
        f = True
        break
    if lsts[i][1] > maxr:
        maxr = lsts[i][1]
        maxl = lsts[i][0]
    if lsts[i][1] < maxr:
        print(lst.index(lsts[i])+1, lst.index([maxl, maxr])+1)
        f = True
        break

if not f:
    print(-1, -1)