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. 
import operator


def solution():
    n = int(raw_input())
    arr = []
    for i in range(n):
        l, r = map(int, raw_input().split())
        arr.append((l, r, i + 1))
    arr.sort(key=operator.itemgetter(0))
    for i in range(1, n):
        if arr[i][0] == arr[i - 1][0]:
            if arr[i][1] > arr[i - 1][1]:
                return arr[i - 1][2], arr[i][2]
            else:
                return arr[i][2], arr[i - 1][2]
        elif arr[i][1] <= arr[i - 1][1]:
            return arr[i][2], arr[i - 1][2]

    arr.sort(key=operator.itemgetter(1))
    for i in range(1, n):
        if arr[i][1] == arr[i - 1][1]:
            if arr[i][0] > arr[i - 1][0]:
                return arr[i][2], arr[i - 1][2]
            else:
                return arr[i - 1][2], arr[i][2]
        elif arr[i][0] <= arr[i - 1][0]:
            return arr[i - 1][2], arr[i][2]

    return -1, -1


if __name__ == '__main__':
    res = solution()
    print res[0], res[1]
