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. 


import javafx.util.Pair;

import java.util.*;



public class Main {

    static class Sortpair implements Comparator<Pair> {

        @Override
        public int compare(Pair o1, Pair o2) {
            int o1First = (int)o1.getKey();
            int o2First = (int)o2.getKey();

            if(o1First!=o2First){
                return o1First-o2First;
            }

            int o1Second = (int) o1.getValue();
            int o2Second = (int) o2.getValue();

            return  o2Second-o1Second;
        }
    }

    static Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {

        int n;
        n = scanner.nextInt();

        ArrayList<Pair>segments = new ArrayList<>();
        HashMap<Pair,Integer>pairMap = new HashMap();

        for(int i=0;i<n;i++){
            int k = scanner.nextInt();
            int v = scanner.nextInt();
            //add to segments
            segments.add(new Pair(k,v));
            if(pairMap.containsKey(new Pair(k,v))){
                System.out.println(pairMap.get(new Pair(k,v)).toString()+" "+Integer.toString(i+1));
                return;
            }
            pairMap.put(new Pair(k,v),i+1);
        }

        if(n==1){
            System.out.println("-1 -1");
            return;
        }

        Collections.sort(segments,new Sortpair());

        for(int i=0;i<n-1;i++){
            Pair element1 = segments.get(i);
            Pair element2 = segments.get(i+1);
            int o1First = (int)element1.getKey();
            int o2First = (int)element2.getKey();
            int o1Second =(int)element1.getValue();
            int o2Second =(int)element2.getValue();
            //System.out.println(element1);
            //System.out.println(element2);
            if(o1First<=o2First && o1Second>=o2Second){
                System.out.println(pairMap.get(element2).toString()+" "+pairMap.get(element1));
                return;
            }
        }

        System.out.println("-1 -1");
        return;

    }
}
