#include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int M = 5e4+;

 char word[M][];

 struct Node{

     bool flag;

     Node *next[];

     Node(){

         flag=false;

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

             next[i]=NULL;

     }

 };

 Node *root=new Node;

 Node *now,*newnode;

 void Insert(char *str){

     now=root;

     for(int i=;str[i];i++){

         int to=str[i]-'a';

         if(now->next[to]==NULL){

             now->next[to]=new Node;

         }

         now=now->next[to];

     }

     now->flag=true;    //标记该节点为单词的结尾

 }

 bool search(char *str){

     now=root;

     for(int i=;str[i];i++){

         int to = str[i]-'a';

         if(now->next[to]==NULL)return false;

         now=now->next[to];

     }

     return now->flag;

 }

 void delete(Node *rt){

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

         if(rt->next[i]!=NULL)

             delete(rt->next[i]);

     delete(rt);

 }

 int main(){

     int cnt=;

     while(gets(word[++cnt])&&strlen(word[cnt]))

         Insert(word[cnt]);

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

         int len=strlen(word[i]);

         for(int j=;j<len;j++){

             char s1[],s2[];

             strncpy(s1,word[i],j+),s1[j+]='\0';     //strncpy中，word[i]代表复制的字符串起始位置，j+1代表要复制的长度

             strncpy(s2,word[i]+j+,len-j-),s2[len-j-]='\0';   //后一段字符串

             if(search(s1)&&search(s2)){

                 printf("%s\n",word[i]);

                 break;

             }

         }

     }

     //delete(root);

 }