#include<iostream>
#include <string.h>
using namespace std;

struct Item{
	int rel;
	char *str;
	Item *next;
};

struct Node{
	int key;
	Item *info;
};

const int SZ =  10 ;

Node table[SZ];
int n;

int find(int key)
{
	int i =  0 , k = n- 1 , j;
	while(i <= k){
		j = (i + k) /  2 ;
		if(table[i].key == key)
			return j;
		if(table[i].key < key)
			i = j +  1 ;
		else
			k = j -  1 ;
	}
	return - 1 ;
}

int ins(int k, char *str)
{
	int r ;
	int j = find(k);
	if(j <  0 ){
		if(n >= SZ)
			return - 1 ;
		j = n++;
		r =  0 ;
	}
	else
		r = table[j].info->rel;

	Item *ne = new Item;
	ne->rel = r +  1 ;
	ne->str = new char[strlen(str)+ 1 ];
	strcpy(ne->str, str);
	ne->next = table[j].info;
	table[j].info = ne;
	return  0 ;
}