cf-【Queue 】

In the Main Berland Bank n people stand in a queue at the cashier, everyone knows his/her height h_i, and the heights of the other people in the queue. Each of them keeps in mind number a_i — how many people who are taller than him/her and stand in queue in front of him.

After a while the cashier has a lunch break and the people in the queue seat on the chairs in the waiting room in a random order.

When the lunch break was over, it turned out that nobody can remember the exact order of the people in the queue, but everyone remembers his number a_i.

Your task is to restore the order in which the people stood in the queue if it is possible. There may be several acceptable orders, but you need to find any of them. Also, you need to print a possible set of numbers h_i — the heights of people in the queue, so that the numbers a_i are correct.

Input

The first input line contains integer n — the number of people in the queue (1 ≤ n ≤ 3000). Then n lines contain descriptions of the people as "name_i a_i" (one description on one line), where name_i is a non-empty string consisting of lowercase Latin letters whose length does not exceed 10 characters (the i-th person's name),a_i is an integer (0 ≤ a_i ≤ n - 1), that represents the number of people who are higher and stand in the queue in front of person i. It is guaranteed that all names are different.

Output

If there's no acceptable order of the people in the queue, print the single line containing "-1" without the quotes. Otherwise, print in n lines the people as "name_i h_i", where h_i is the integer from 1 to 10⁹ (inclusive), the possible height of a man whose name is name_i. Print the people in the order in which they stand in the queue, starting from the head of the queue and moving to its tail. Numbers h_iare not necessarily unique.

Example

Input

4
a 0
b 2
c 0
d 0

Output

a 150
c 170
d 180
b 160

Input

4
vasya 0
petya 1
manya 3
dunay 3

Output

-1

#include<cstdio>
#include<algorithm>
using namespace std;
struct que
{
	char name[20];
	int pre;
	int h; 
}a[3100]; 
bool cmp(que b,que c)
{
	return b.pre<c.pre;
} 
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		int i,j;
		for(i=1;i<=n;++i)
			scanf("%s%d",a[i].name,&a[i].pre);
		sort(a+1,a+n+1,cmp);
		bool tag=false;
		for(i=1;i<=n;++i)
		{
			if(a[i].pre>=i)
			{
				tag=true;
				break;
			} 
			a[i].h=i-a[i].pre;
			for(j=1;j<i;++j)
			{
				if(a[j].h>=a[i].h)
					a[j].h++; 
			} 
		}
		if(tag)
			printf("-1\n");
		else
		{
			for(i=1;i<=n;++i)
				printf("%s %d\n",a[i].name,a[i].h); 
		} 
	} 
	return 0;
}