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. 
#include <bits/stdc++.h>
using namespace std;
struct st {
  int l, r, index;
} ara[300010];
bool cmp(st a, st b) {
  if (a.l < b.l)
    return true;
  else if (a.l == b.l) {
    if (a.r < b.r)
      return true;
    else
      return false;
  } else
    return false;
}
int main() {
  int n, ll, rr, ansi = -1, ansj = -1;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", &ll, &rr);
    ara[i].l = ll, ara[i].r = rr, ara[i].index = i;
  }
  sort(ara + 1, ara + n + 1, cmp);
  for (int i = 1; i < n; i++) {
    ll = ara[i + 1].l;
    rr = ara[i + 1].r;
    if (ll >= ara[i].l and rr <= ara[i].r) {
      ansi = ara[i + 1].index;
      ansj = ara[i].index;
      break;
    } else if (ara[i].l >= ll and ara[i].r <= rr) {
      ansi = ara[i].index;
      ansj = ara[i + 1].index;
    }
  }
  cout << ansi << ' ' << ansj << endl;
}
