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;
const int maxn = 3e5 + 10;
struct ac {
  int l, r, i;
};
ac a[maxn];
bool cmp(ac a, ac b) {
  if (a.l == b.l) return a.r > b.r;
  return a.l < b.l;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int ans1, ans2;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].l >> a[i].r;
    a[i].i = i;
  }
  int f = 0;
  sort(a + 1, a + 1 + n, cmp);
  int max1 = a[1].r;
  ans2 = a[1].i;
  for (int i = 2; i <= n; i++) {
    int r = a[i].r;
    if (r <= max1) {
      ans1 = a[i].i;
      f = 1;
      break;
    }
    if (r > max1) {
      ans2 = a[i].i;
      max1 = r;
    }
  }
  if (f) {
    cout << ans1 << " " << ans2 << '\n';
  } else
    cout << -1 << " " << -1 << '\n';
}
