/*ID: qq104801LANG: C++TASK: lgame*/#include <iostream>#include <fstream>#include <cstring>#include <vector>#include <queue>#include <stack>#include <algorithm>using namespace std;int cmp(const void* a,const void* b){    return *(string*)a > *(string*)b?1:-1;}const int  len=40000;FILE* ff;int s[26]={2,5,4,4,1,6,5,5,1,7,6,3,5,2,3,5,7,2,1,2,4,6,6,7,5,7};int d[26];string a[len];void test(){       freopen("lgame.in","r",stdin);      freopen("lgame.out","w",stdout);      ff=fopen("lgame.dict","r");        int l=-1;    string str;    cin >>str;        for(int i=0;i<str.length();i++)        d[str[i]-‘a‘]++;    string ss;    char ch[10];    fscanf(ff,"%s",ch);ss=ch;    while(ss!=".")    {        bool bb=false;        for(int i=0;i<ss.length();i++)            if(!d[ss[i]-‘a‘]){bb=true;break;}        if(!bb)a[++l]=ss;        fscanf(ff,"%s",ch);ss=ch;    }    fclose(ff);        qsort(a,l,sizeof(a[l+1]),cmp);    int c[len]={0};    for(int i=0;i<=l;i++)    {        int t=0;        for(int j=0;j<a[i].length();j++)            t+=s[a[i][j]-‘a‘];        c[i]=t;    }    int u[26]={0};    string ans[len];    int p=0,kk[len]={0},max=0;    for(int i=0;i<=l;i++)        for(int j=i;j<=l+1;j++)        {            memset(u,0,sizeof(u));            int l1;            int yy=0;                        for(l1=0;l1<a[i].length();l1++)            {                char x=a[i][l1];                            u[x-‘a‘]++;                yy+=s[x-‘a‘];            }            for(l1=0;l1<a[j].length();l1++)            {                char y=a[j][l1];                u[y-‘a‘]++;                yy+=s[y-‘a‘];            }            bool bo=false;            for(int k=0;k<26;k++)                if(u[k]>d[k]){bo=true;break;}            if(!bo)            {                ans[++p]=a[i];                if(a[j].length())ans[p]=a[i]+" "+a[j];                kk[p]=yy;if(yy>max)max=yy;            }        }    cout<<max<<endl;    for(int i=1;i<=p;i++)        if(kk[i]==max)            cout<<ans[i]<<endl;}int main () {            test();            return 0;}