Score : $300$ points
Snuke loves "paper cutting": he cuts out characters from a newspaper headline and rearranges them to form another string.
He will receive a headline which contains one of the strings $S_1,...,S_n$ tomorrow. He is excited and already thinking of what string he will create. Since he does not know the string on the headline yet, he is interested in strings that can be created regardless of which string the headline contains.
Find the longest string that can be created regardless of which string among $S_1,...,S_n$ the headline contains. If there are multiple such strings, find the lexicographically smallest one among them.
z) for every $i = 1, ..., n$.
Input is given from Standard Input in the following format:
$n$ $S_1$ $...$ $S_n$
Print the lexicographically smallest string among the longest strings that satisfy the condition. If the answer is an empty string, print an empty line.
3 cbaa daacc acacac
The strings that can be created from each of
caa and so forth.
caa are the longest, and the lexicographically smallest of these three is
3 a aa b
The answer is an empty string.