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 node {
  unsigned long int val;
  long int index;
  unsigned long int other;
};
bool cmp(node& a, node& b) {
  if (a.val != b.val)
    return a.val < b.val;
  else
    return a.other > b.other;
}
struct node2 {
  bool operator()(const node& a, const node& b) const {
    if (a.other != b.other)
      return a.other < b.other;
    else if (a.val != b.val)
      return a.val < b.val;
    else
      return a.index < b.index;
  }
};
int main() {
  unsigned long int n;
  scanf("%lu", &n);
  vector<node> all(n);
  for (unsigned long int i = 0; i < n; i++) {
    scanf("%lu", &all[i].other);
    scanf("%lu", &all[i].val);
    if (all[i].other > all[i].val) swap(all[i].other, all[i].val);
    all[i].index = i + 1;
  }
  sort(all.begin(), all.end(), cmp);
  unsigned long int outer = 0, id = 0;
  set<node, node2> ended;
  for (unsigned long int i = 0; i < n; i++) {
    auto it = ended.insert(all[i]).first;
    auto it1 = it, it2 = it;
    it1++;
    if (it1 != ended.end()) {
      outer = (*it).index;
      id = (*it1).index;
      break;
    } else if (it2 != ended.begin()) {
      it2--;
      if ((*it2).other >= (*it).other) {
        outer = (*it).index;
        id = (*it2).index;
      }
    }
  }
  if (outer == 0)
    printf("-1 -1\n");
  else
    printf("%lu %lu\n", id, outer);
  return 0;
}
