PAT 1035

#include<cstdio>
#include<algorithm>
#include<stdlib.h>
#include<cstring>
#include<math.h>

struct pnode
{
	char name[20];
	char pw[20];
	bool ischange;
}temp[1010];
int main()
{
	int n,k=0;
	int len;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%s %s",temp[i].name,temp[i].pw);	
		len=strlen(temp[i].pw);
		temp[i].ischange=false;
		for(int j=0;j<len;j++)
		{
			if(temp[i].pw[j]=='1')
			{
				temp[i].pw[j]='@';
				temp[i].ischange=true;
			}
			else	
				if(temp[i].pw[j]=='l')
				{
					temp[i].pw[j]='L';
					temp[i].ischange=true;
				}
			else	
				if(temp[i].pw[j]=='0')
				{
					temp[i].pw[j]='%';
					temp[i].ischange=true;
				}
			else	
				if(temp[i].pw[j]=='O')
				{
					temp[i].pw[j]='o';
					temp[i].ischange=true;
				}				
		}
		  if(temp[i].ischange)
				k++;

	}
	if(k!=0)
	{
		printf("%d\n",k);
		for(int i=0;i<n;i++)
		{
			if(temp[i].ischange==true)
				printf("%s %s\n",temp[i].name,temp[i].pw);
		}
	}
	else if(n==1&&k==0)
		printf("There is %d account and no account is modified",n);
	else
		printf("There are %d accounts and no account is modified",n);
	

	system("pause");
	return 0;
}