#include<iostream.h>
#include<string.h>
#include<stdlib.h>
int compare(const void *a, const void *b)
{
	return -(strcmp((char*)a,(char*)b));
}
void main()
{
	int n,i,j,m=0,k=0;
	cin>>n;
	char a[16];char b[10000][8];int c[10000]={0};
	for(i=0;i<n;i++){
		cin>>a;
		for(j=0;j<(int)strlen(a);j++)
		{   if(a[j]=='Q'||a[j]=='Z'){a[j]='-';}
			
	    	if(a[j]-'0'>=17&&a[j]-'0'<=19){a[j]='2';}
			if(a[j]-'0'>=20&&a[j]-'0'<=22){a[j]='3';}
			if(a[j]-'0'>=23&&a[j]-'0'<=25){a[j]='4';}
			if(a[j]-'0'>=26&&a[j]-'0'<=28){a[j]='5';}
			if(a[j]-'0'>=29&&a[j]-'0'<=31){a[j]='6';}
			if(a[j]-'0'>=32&&a[j]-'0'<=35){a[j]='7';}
			if(a[j]-'0'>=36&&a[j]-'0'<=38){a[j]='8';}
			if(a[j]-'0'>=39&&a[j]-'0'<=41){a[j]='9';}

		}

		j=0;
		for(m=0;m<15;m++){
			if(a[m]!='-'&&a[m]!=' '){b[i][j]=a[m];j++;}}
	}  qsort(b,n,8,compare);
	for(j=0;j<n-1;j++){
	for(i=j+1;i<n;i++){
		if(b[j][0]==b[i][0]&&b[j][1]==b[i][1]&&b[j][2]==b[i][2]&&b[j][3]==b[i][3]&&b[j][4]==b[i][4]&&b[j][5]==b[i][5]&&b[j][6]==b[i][6]) 
		{b[i][0]='Q';c[j]++;}}}
		
    	
			for(i=0;i<n;i++){
		    if(b[i][0]-'0'!=('Q'-'0')&&c[i]>0){
			for(m=0;m<8;m++){if(m==3){cout<<"-";}cout<<b[i][m];}
			cout<<""<<c[i]+1<<endl;k=1;}}
		if(k==0)cout<<"No duplicates.";
	


}