1035

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct account{
	char name[12];
	char p[12];
	int flag ;
}acc[1100];
int main()
{
	int n;
	scanf("%d",&n);
	for(int i = 0; i < n; i++)
	{
		scanf("%s %s",acc[i].name,acc[i].p);
		acc[i].flag = 0;
	}
	int m = 0; 
	for(int i = 0; i < n; i++)
	{
		int len = strlen(acc[i].p);
		for(int j = 0; j < len; j++)
		{
			if(acc[i].p[j] == '1') 
			{
				acc[i].p[j] = '@';acc[i].flag = 1;
			}
			else if(acc[i].p[j] == '0') 
			{
				acc[i].p[j] = '%';acc[i].flag = 1;
			}
			else if(acc[i].p[j] == 'l') 
			{
				acc[i].p[j] = 'L';acc[i].flag = 1;
			}
			else if(acc[i].p[j] == 'O') 
			{
				acc[i].p[j] = 'o';acc[i].flag = 1;
			}
			
		}
	}
	for(int i = 0; i < n; i++)
	{
		if(acc[i].flag == 1) m ++;
	}
	if(m == 0&& n == 1)
	printf("There is 1 account and no account is modified\n");
	else if(m == 0 && n > 1) 
	printf("There are %d accounts and no account is modified\n",n);
	else{
		printf("%d\n",m);
		for(int i = 0; i < n ; i++)
		{
			if(acc[i].flag == 0) continue;
			printf("%s %s\n",acc[i].name,acc[i].p);
			
		}
	}
	
	
	return 0;
}