407126: GYM102697 097 Neon Lights

Neon Lights

You are trying to find strings of text to put on neon lights. You want to fully test the extent of the neon lights' writing style for letters, so you want to pick the string of text that has the highest number of distinct (different) letters from a selection of possible strings of text.

The first line of input contains a positive integer $$$n$$$ indicating the number of strings of text that you are considering putting on neon lights. The next $$$n$$$ lines each contain each string of text, consisting of only lowercase letters and spaces.

Output the string of text from the possibilities which has the highest number of distinct letters. If two strings of text contain the same number of distinct letters, choose the one that comes first in the input file.

6
coderams club
neon lights
kraftwerk
this is a long string of text
abababababababababcabababab
short

this is a long string of text

3
the quick brown fox jumps over the lazy dog
abcdefghijklmnopqrstuvwxy
hello world

the quick brown fox jumps over the lazy dog

3
abcde
abc
edcba

abcde