#include <iostream>
#include <iomanip>
#include <algorithm>
using namespace std;
int map(char ch)
{
int num = 0;
switch(ch)
{
case 'A':case'B':case'C':
num = 2; break;
case 'D':case'E':case'F':
num = 3;break;
case 'G':case'H':case'I':
num = 4;break;
case 'J':case'K':case'L':
num = 5;break;
case 'M':case'N':case'O':
num = 6;break;
case 'P':case'S':case'R':
num = 7;break;
case 'T':case'U':case'V':
num = 8;break;
case 'W':case'X':case'Y':
num = 9;break;
}
return num;
}
int main()
{
int number[100000];
bool isRepeat = false;
int index = 0;
int n = 0;
cin>>n;
while(n--)
{
int num = 0;
char data[20];
cin>>data;
for(int i = 0;data[i]!='\0';i++)
{
if(data[i] == '-' || data[i] == 'Q' || data[i] == 'Z')
continue;
if(data[i]<='9')
num = num*10+(data[i]-'0');
else
num = num*10+map(data[i]);
}
number[index++] = num;
}
sort(number,number+index);
int repeat = 1;
for(int i = 0;i<index;i++)
{
if(number[i] == number[i+1])
repeat++;
else if(repeat>1)
{
int sub_1 = number[i] / 10000;
int sub_2 = number[i] %10000;
cout<<setfill('0')<<setw(3)<<sub_1<<"-"<<setfill('0')<<setw(4)<<sub_2<<" "<<repeat<<endl;
isRepeat = true;
repeat = 1;
}
}
if(!isRepeat)
cout<<"No duplicates."<<endl;
return 0;
}