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;
pair<int, int> a[300005];
int b[300005];
map<pair<int, int>, int> mapp;
int n;
int cmp1(pair<int, int> x, pair<int, int> y) {
  if (x.first == y.first) return x.second > y.second;
  return x.first < y.first;
}
int main() {
  cin >> n;
  int x, y;
  for (int i = 0; i < n; ++i) {
    cin >> x >> y;
    a[i] = make_pair(x, y);
    if (mapp[a[i]] != 0)
      mapp[make_pair(a[i].first - 100000000, a[i].second - 100000000)] = i;
    else
      mapp[a[i]] = i;
  }
  sort(a, a + n, cmp1);
  for (int i = 0; i < n; ++i) b[i] = a[i].second;
  int *tmp;
  for (int i = 0; i < n - 1; ++i) {
    tmp = upper_bound(b + i + 1, b + n, a[i].second);
    if (tmp != b + i + 1) {
      if (a[tmp - 1 - b].first == a[i].first &&
          a[tmp - 1 - b].second == a[i].second) {
        cout << mapp[a[tmp - 1 - b]] + 1 << " "
             << mapp[make_pair(a[i].first - 100000000,
                               a[i].second - 100000000)] +
                    1;
        return 0;
      }
      cout << mapp[a[tmp - 1 - b]] + 1 << " " << mapp[a[i]] + 1;
      return 0;
    }
  }
  cout << "-1 -1";
}
