#include
#include
#include
using namespace std;
const int maxn = 1000;
char str[maxn][maxn];
int mark[maxn] = {0};
char ch,sumch[maxn];
int n;
int max1;
void show(int len) {
max1=len;//曲最长长度
}
int check(char ch1[]) {//核对是否符合龙
int len_ch1 = strlen(ch1);
int len_sumch = strlen (sumch);
int i;
for (i=len_sumch-1;i>=0;i--) {
if (sumch[i]==ch1[0]) break;
}
int pos=0;
for (int j=i;j) {
if (sumch[j]!=ch1[pos++]) return 0;
}
if (pos==len_ch1) return 0;
else return i;
}
void search() {
for (int i=0;i) {
if (mark[i]<2) {//次数是否出现过两次
int check_pos=check(str[i]);
if (check_pos) {
int len=strlen(sumch);
int pos=0;
for (int j=len-check_pos;j) {
sumch[len+pos]=str[i][j];
pos++;
}
if (max1<strlen(sumch))show (strlen(sumch));
mark[i]++;
search();
mark[i]--;//回溯
for (int j=len;j‘\0‘;
}
}
}
}
int main() {
cin >> n;
cin.get();
for (int i=0;i) {
gets(str[i]);
}
cin >> ch;
max1=0;
for (int i=0;i) {
memset(sumch,sizeof(sumch),‘\0‘);
memset(mark,sizeof(mark),0);
if (str[i][0]==ch) {
strcat(sumch,str[i]);
mark[i]++;
search();
}
}
cout < endl;
}