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 MAX = 300005;
struct Node {
  int l, r, id;
  bool operator<(const Node &a) const {
    if (l == a.l) return r > a.r;
    return l < a.l;
  }
} aa[MAX];
int n, r, id;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> aa[i].l >> aa[i].r;
    aa[i].id = i;
  }
  sort(aa + 1, aa + 1 + n);
  id = aa[1].id;
  r = aa[1].r;
  for (int i = 2; i <= n; ++i) {
    if (aa[i].r <= r) {
      cout << aa[i].id << " " << id << endl;
      return 0;
    }
    r = aa[i].r;
    id = aa[i].id;
  }
  cout << -1 << " " << -1 << endl;
  return 0;
}
