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.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class CF_254_A_CARDS_WITH_NUMBERS {

	public static void main(String[] args) throws Exception{
		Scanner sc = new Scanner(new FileInputStream(new File("input.txt")));
		int n = 2*sc.nextInt();
		
		StringBuilder st = new StringBuilder();
		Pair [] a = new Pair [n];
		for(int i = 0 ; i<n ;i++)
			a[i] = new Pair(sc.nextInt(),i+1);
		
		PrintWriter out = new PrintWriter("output.txt");
		
		shuffle(a);
		Arrays.sort(a);
		
		for(int i = 0 ; i<n-1 ;i+=2)
		{
			if(a[i].value == a[i+1].value)
				st.append(a[i].index).append(" ").append(a[i+1].index).append("\n");
			else
			{
				out.println(-1);
				out.flush();
				return;
			}
		}
		
		out.print(st);
		
		out.flush();
		out.close();
		
		
		
		

	}
	
	static void shuffle(Pair[] a)
	{
		int n = a.length;
		for(int i = 0; i < n; i++)
		{
			int r = i + (int)(Math.random() * (n - i));
			Pair tmp = a[i];
			a[i] = a[r];
			a[r] = tmp;
		}
	}
	
	static class Pair implements Comparable<Pair>
	{

		int value ;
		int index ;
		
		public Pair (int value , int index)
		{
			this.value = value ;
			this.index = index ;
			
		}
		
		@Override
		public int compareTo(Pair p) {
			return p.value - this.value;
		}
		
		
	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream fileReader) {
			br = new BufferedReader(new InputStreamReader(fileReader));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public double nextDouble() throws IOException {
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-') {
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.') {
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else {
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

	}
}