Unique Maximum Unique Characters

Given a list of strings, your task is to determine the string that has the maximum number of unique characters. In the event of a tie, the string that appears earliest in the list should be chosen.

Formally, let \( S = \{ s_1, s_2, \dots, s_n \} \) be a sequence of strings. For each string \( s_i \), define \( U(s_i) \) as the set of its unique characters. You are required to choose the string \( s_k \) that maximizes \( |U(s_k)| \), and in case of a tie, \( k \) should be the smallest possible index.

inputFormat

The input begins with an integer \( n \) (\(1 \le n \le 1000\)), representing the number of strings. Each of the next \( n \) lines contains one non-empty string composed of printable ASCII characters.

outputFormat

Output a single string — the one with the maximum number of unique characters. If there is a tie, output the string that appears first.

1
singular

singular