#include <cstdio>

 #include <cstring>

 #include <string>

 #include <algorithm>

 #include <queue>

 #include <map>

 using namespace std;

 const int maxnod =  *  + ;

 int n;

 char str[][], T[];

 map<string, int> mp;

 struct AC_Automata {

     int ch[maxnod][];//Trie树转移

     int cnt[];//每个子串出现了几次

     int val[maxnod];//某节点是否为子串结尾以及是哪个串的结尾

     int f[maxnod];//失配，转移到别的树枝继续找

     int last[maxnod];//找到了后缀相同的其他可行子串

     int sz;

     void init() {

         sz = ;

         mp.clear();//与ac自动机无关

         memset(ch[], , sizeof ch[]);

         memset(cnt, , sizeof cnt);

     }

     int idx(char c) { return c - 'a'; }

     void insert(char* s, int v) {//Trie树的插入

         int u = , n =strlen(s);

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

             int c = idx(s[i]);

             if (!ch[u][c]) {

                 memset(ch[sz], , sizeof ch[sz]);

                 val[sz] = ;

                 ch[u][c] = sz++;

             }

             u = ch[u][c];

         }

         val[u] = v;

     }

     void getfail() {

         queue<int> Q;

         f[] = ;

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

             int u = ch[][i];

             if (u) {

                 f[u] = last[u] = ;

                 Q.push(u);

             }

         }

         while (!Q.empty()) {

             int r = Q.front(); Q.pop();

             for (int c = ; c < ; c++) {

                 int u = ch[r][c];

                 if (!u)    continue;

                 Q.push(u);

                 int v = f[r];

                 while (v && !ch[v][c])    v = f[v];//当前这个不行看看别人行不行

                 f[u] = ch[v][c];

                 last[u] = val[f[u]] ? f[u] : last[f[u]];

             }

         }

     }

     void Success(int j) {

         if (j) {

             cnt[val[j]]++;

             Success(last[j]);

         }

     }

     void find(char* T) {

         int n = strlen(T);

         for (int i = , j = ; i < n; ++i) {

             int c = idx(T[i]);

             while (j && !ch[j][c])    j = f[j];

             j = ch[j][c];

             if (val[j])    Success(j);

             else if (last[j])    Success(last[j]);

         }

     }

 }ac;

 int main() {

     while (~scanf("%d", &n) && n) {

         ac.init();

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

             scanf("%s", str[i]);

             ac.insert(str[i], i);

             mp[str[i]] = i;

         }

         ac.getfail();

         scanf("%s", T);

         ac.find(T);

         int ans = -;

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

             ans = max(ans, ac.cnt[i]);

         }

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

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

             if (ac.cnt[mp[str[i]]] == ans)    puts(str[i]);

         }

     }

     return ;

 }