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;
int main(int argc, char** argv) {
  pair<int, int> arr[300005];
  int n = 0, x = 0, y = 0, f = 0, s = 0, r = 0;
  map<pair<int, int>, int> m;
  pair<int, int> low;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x >> y;
    arr[i] = {x, y};
    if (m.count({x, y}) > 0) {
      f = i;
      s = x, r = y;
    } else {
      m[make_pair(x, y)] = i;
    }
  }
  if (f != 0) {
    cout << f << " " << m[{s, r}];
  } else {
    sort(arr + 1, arr + n + 1);
    low = make_pair(arr[n].first, arr[n].second);
    for (int i = n - 1; i > 0; i--) {
      if (low.second > arr[i].second && low.first != arr[i].first)
        low = make_pair(arr[i].first, arr[i].second);
      else if (low.first == arr[i].first) {
        cout << m[{arr[i].first, arr[i].second}] << " "
             << m[{low.first, low.second}];
        return 0;
      } else {
        cout << m[{low.first, low.second}] << " "
             << m[{arr[i].first, arr[i].second}];
        return 0;
      }
    }
    cout << -1 << " " << -1;
  }
  return 0;
}
