Problem: Petya has got 2n cards, each card contains some integer. The numbers on the cards can be the same. Let's index all cards by consecutive integers from 1 to 2n. We'll denote the number that is written on a card with number i, as ai. In order to play one entertaining game with his friends, Petya needs to split the cards into pairs so that each pair had equal numbers on the cards. Help Petya do that.

Input

The first line contains integer n (1 ≤ n ≤ 3·105). The second line contains the sequence of 2n positive integers a1, a2, ..., a2n (1 ≤ ai ≤ 5000) — the numbers that are written on the cards. The numbers on the line are separated by single spaces.

Output

If it is impossible to divide the cards into pairs so that cards in each pair had the same numbers, print on a single line integer -1. But if the required partition exists, then print n pairs of integers, a pair per line — the indices of the cards that form the pairs.

Separate the numbers on the lines by spaces. You can print the pairs and the numbers in the pairs in any order. If there are multiple solutions, print any of them.

Examples

Input

3
20 30 10 30 20 10


Output

4 2
1 5
6 3


Input

1
1 2


Output

-1

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;

public class CodeForces {
    static long []divisors=new long[1000005];
    public static void main(String[] args) throws IOException {
        //reader input = new reader();
        //PrintWriter output=new PrintWriter(System.out);
        BufferedReader bf = new BufferedReader(new FileReader("input.txt"));
        PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
        StringTokenizer stk = new StringTokenizer(bf.readLine());
        int n=Integer.parseInt(stk.nextToken());
        Pair arr[]=new Pair[2*n];
        stk = new StringTokenizer(bf.readLine());
        for(int i=1;i<=2*n;i++){
            arr[i-1]=new Pair(Integer.parseInt(stk.nextToken()),i);
        }
        Arrays.sort(arr,(a,b)-> {
            if(a.val!=b.val)
                return a.val-b.val;
            else
                return a.index-b.index;
        });
        int a[]=new int[n];
        int b[]=new int[n];
        boolean check=true;
        for(int i=0;i<2*n;i+=2){
            if(arr[i].val==arr[i+1].val){
                a[i/2]=arr[i].index;
                b[i/2]=arr[i+1].index;
            }else{
                check=false;
                break;
            }
        }
        if(check){
            for(int i=0;i<n;i++){
                pw.println(a[i]+" "+b[i]);
            }
        }else{
            pw.println(-1);
        }
        pw.close();
        //output.close();
    }
    public static long divisors(int n){
        if(divisors[n]!=0)
            return divisors[n];
        long ans=0;
        for(int i=1;i*i<=n;i++){
            if(n%i==0){
                ans++;
                if(n/i!=i)
                    ans++;
            }
        }
        divisors[n]=ans;
        return ans;
    }

    static boolean prime(long a){
        if(a==2||a==3)
            return true;
        if((a-1)%6==0)
            return true;
        if((a+1)%6==0)
            return true;
        return false;
    }
}
class Pair{
    int val,index;
    Pair(int val,int index){
        this.val=val;
        this.index=index;
    }
}

class reader {
    BufferedReader br;
    StringTokenizer st;
    public reader() {
        br = new BufferedReader(new
                InputStreamReader(System.in));
    }
    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }
    int nextInt() {
        return Integer.parseInt(next());
    }
    long nextLong() {
        return Long.parseLong(next());
    }
    double nextDouble() {
        return Double.parseDouble(next());
    }
    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
    public int[] nextIntArray(int arraySize) {
        int array[] = new int[arraySize];
        for (int i = 0; i < arraySize; i++) {
            array[i] = nextInt();
        }
        return array;
    }
    public long[] nextLongArray(int arraySize) {
        long array[] = new long[arraySize];
        for (int i = 0; i < arraySize; i++) {
            array[i] = nextLong();
        }
        return array;
    }
}