紫书UVa10391

#include <map>
#include <sstream>
#include <string>
#include<iostream>
#include<cstdio>
#include <algorithm>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<set>
#include<stack>
#include<queue>
#include<cstring>
using namespace std;
int main()
{
	set<string>dict;
	string word;
	while (cin >> word)
	{
		dict.insert(word);
	}
	for (auto elem : dict)
	{
		for (int i = 1; i < elem.size(); ++i)
		{
			string left = elem.substr(0, i);
			string right = elem.substr(i, elem.size() - i);
			if (dict.count(left) > 0 && dict.count(right) > 0)
			{
				cout << elem << endl;
				break;
			}
		}
	}
}