#include<iostream>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<cstdio>

#include<map>

#include<queue>

#include<vector>

using namespace std;

int n;

struct X

{

    string a;

    string b;

    bool flag;

} s[+];

int main()

{

    scanf("%d",&n);int fail=;

    for(int i=; i<=n; i++)

    {

        cin>>s[i].a>>s[i].b;

        s[i].flag=;

        for(int j=; j<s[i].b.length(); j++)

        {

            if(s[i].b[j]=='') s[i].flag=,s[i].b[j]='@';

            if(s[i].b[j]=='') s[i].flag=,s[i].b[j]='%';

            if(s[i].b[j]=='l') s[i].flag=,s[i].b[j]='L';

            if(s[i].b[j]=='O') s[i].flag=,s[i].b[j]='o';

        }

        fail=fail+s[i].flag;

    }

    if(fail==)

    {

        if(n==||n==) printf("There is %d account and no account is modified\n",n);

        else printf("There are %d accounts and no account is modified\n",n);

    }

    else

    {

        printf("%d\n",fail);

        for(int i=; i<=n; i++)

        {

            if(s[i].flag==) continue;

            cout<<s[i].a<<" "<<s[i].b<<endl;

        }

    }

    return ;

}