#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct note{
char usr[11];
char pwd[11];
}mem[1001];
int flag[1001];
int main()
{
int n;
cin>>n;
int cnt=0;
int f=0;
for(int i=0;i<n;i++)
{
scanf("%s %s",mem[i].usr,mem[i].pwd);
int len= strlen(mem[i].pwd);
for(int j=0;j<len;j++){
if(mem[i].pwd[j]=='1'){
flag[i]=1;
mem[i].pwd[j]='@';
}else if(mem[i].pwd[j]=='0'){
flag[i]=1;
mem[i].pwd[j]='%';
}else if(mem[i].pwd[j]=='l'){
flag[i]=1;
mem[i].pwd[j]='L';
}else if(mem[i].pwd[j]=='O'){
flag[i]=1;
mem[i].pwd[j]='o';
}
}
if(flag[i]){
cnt++;
f=1;
}
}
if(f){
cout<<cnt<<endl;
for(int i=0;i<n;i++){
if(flag[i]) {
printf("%s %s\n",mem[i].usr,mem[i].pwd);
}
}
}
if(!f){
if(n==1)printf("There is 1 account and no account is modified");
else printf("There are %d accounts and no account is modified",n);
}
return 0;
}