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.util.*;
import java.io.*;
public class Dazil{

	public static String chatRoom(String s){
		String greeting = "hello";
		int i = 0;
		int j = 0;
		while(i < greeting.length()
			&& j < s.length()){
			if(s.charAt(j) == greeting.charAt(i)){
				j = j + 1;
				i = i + 1;
			}else{
				j = j + 1;
			}
		}
		return (i == greeting.length())? "YES":"NO";
	}

	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new FileReader(new File("input.txt"))); 
		BufferedWriter wr = new BufferedWriter(new FileWriter(new File("output.txt")));
		HashMap<String, Integer> lookup = new HashMap<>();
		int n = Integer.parseInt(br.readLine());
		int m = 2*n;
		int ans[] = new int[m];
		String st = null;
		int j = 0;
		while((st = br.readLine()) != null){
			String data[] = st.split(" ");
			for(int i = 0; i < data.length; i++){
				if(!lookup.containsKey(data[i])){
					lookup.put(data[i], i + 1);
				}else{
					ans[j++] = lookup.get(data[i]);
					ans[j++] = i + 1;
					lookup.remove(data[i]); 
				}
			}
		}
		
		if(!lookup.isEmpty()){
			wr.write("-1");
		}else{
			j = 0;
			while(j < m - 2){
				wr.write(ans[j] + " " + ans[j + 1]+"\n");
				j = j + 2;
			}
			wr.write(ans[j] + " " + ans[j + 1]);
		}
		br.close();
		wr.close();
	}
}