/*
ID: cmykrgb1
PROG: lgame
LANG: C++
*/
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("lgame.in");
ifstream fd("lgame.dict");
ofstream fo("lgame.out");

typedef struct
{
	char c[7];
	int len;
	int score;
}str;

typedef struct
{
	char c1[7],c2[7];
	int len1,len2;
}Tans;

int uw['z'+1],used['z'+1];
int v['z'+1];
str S[40001];
Tans ans[50];
int N=1,L,acnt;
int Ms=0;

void init()
{
	int i;
	char c;
	bool k;
	while (!fi.eof())
	{
		c=fi.get();
		uw[c]++;
	}
	while (c!='.')
	{
		memset(used,0,sizeof(used));
		L++;
		c=fd.get();
		if (c=='.')
			break;
		k=true;
		while (c==10 || c==13)	c=fd.get();
		S[N].len=0;
		while (c!=10 && c!=13)
		{
			S[N].c[ S[N].len++ ]=c;
			used[c]++;
			if (!uw[c])
				k=false;
			c=fd.get();
		}
		S[N].c[ S[N].len ]=0;
		for (i='a';i<='z';i++)
			if (used[i]>uw[i])
			{
				k=false;
				break;
			}
		if (k)
			N++;
	}
	N--;
	v['q']=v['j']=v['z']=v['x']=7;
	v['w']=v['f']=v['k']=v['v']=6;
	v['y']=v['p']=v['g']=v['h']=v['b']=v['m']=5;
	v['u']=v['d']=v['c']=4;
	v['o']=v['l']=3;
	v['r']=v['t']=v['a']=v['n']=2;
	v['e']=v['i']=v['s']=1;
}

void findans()
{
	int i,k,p;
	for (i=1;i<=N;i++)
	{
		for (k=0;k<=S[i].len-1;k++)
			S[i].score+=v[ S[i].c[k] ];

		if (S[i].score>Ms)
		{
			Ms=S[i].score;
			acnt=1;
			for (p=0;p<=S[i].len-1;p++)
				ans[acnt].c1[p]=S[i].c[p];
			ans[acnt].len1=S[i].len;
			ans[acnt].c1[ ans[acnt].len1 ]=0;
		}
		else if (S[i].score==Ms)
		{
			acnt++;
			for (p=0;p<=S[i].len-1;p++)
				ans[acnt].c1[p]=S[i].c[p];
			ans[acnt].len1=S[i].len;
			ans[acnt].c1[ ans[acnt].len1 ]=0;
		}
	}
}

void findpair()
{
	memset(used,0,sizeof(used));
	int i,j,p;
	bool K;
	int T;
	for (i=1;i<=N-1;i++)
	{
		for (j=i+1;j<=N;j++)
		{
			T=S[i].score+S[j].score;
			for (p=0;p<=S[i].len-1;p++)
				used[S[i].c[p]]++;
			for (p=0;p<=S[j].len-1;p++)
				used[S[j].c[p]]++;
			K=true;
			for (p='a';p<='z';p++)
				if (used[p]>uw[p])
				{
					K=false;
					break;
				}
			memset(used,0,sizeof(used));
			if (!K) continue;
			if (T>Ms)
			{
				Ms=T;
				acnt=1;
				for (p=0;p<=S[i].len-1;p++)
					ans[acnt].c1[p]=S[i].c[p];
				ans[acnt].len1=S[i].len;
				ans[acnt].c1[ ans[acnt].len1 ]=0;
				for (p=0;p<=S[j].len-1;p++)
					ans[acnt].c2[p]=S[j].c[p];
				ans[acnt].len2=S[j].len;
				ans[acnt].c2[ ans[acnt].len2 ]=0;
			}
			else if (T==Ms)
			{
				acnt++;
				for (p=0;p<=S[i].len-1;p++)
					ans[acnt].c1[p]=S[i].c[p];
				ans[acnt].len1=S[i].len;
				ans[acnt].c1[ ans[acnt].len1 ]=0;
				for (p=0;p<=S[j].len-1;p++)
					ans[acnt].c2[p]=S[j].c[p];
				ans[acnt].len2=S[j].len;
				ans[acnt].c2[ ans[acnt].len2 ]=0;
			}
		}
	}
}


void print()
{
	fo << Ms << endl;
	int i,j;
	for (i=1;i<=acnt;i++)
	{
		for (j=0;j<=ans[i].len1-1;j++)
			fo << ans[i].c1[j];
		if (ans[i].len2)
		{
			fo << ' ';
			for (j=0;j<=ans[i].len2-1;j++)
				fo << ans[i].c2[j];
		}
		fo <<endl;
	}
}

inline int cmp(const void *a,const void *b)
{
	int k;
	Tans *A=(Tans *)a,*B=(Tans *)b;
	k=strcmp(A->c1,B->c1);
	if (k!=0) return k;
	k=strcmp(A->c2,B->c2);
	return k;
}

void sortans()
{
	qsort(ans+1,acnt,sizeof(Tans),cmp);
	print();
}

int main()
{
	init();
	findans();
	findpair();
	sortans();
	fi.close();
	fd.close();
	fo.close();
	return 0;
}