The GJam story is to determine the rightful leader. The leader is the person whose name utilizes the most unique letters, spaces do not count, and if two or more people are tied then the leader is the one whom comes first alphabetically, with space preceding A, given a list of 100 or fewer names.

Input: [names], a cell array of names using only A thru Z; max 100 names

Output: [Leader], a string of the name of the leader

Examples: [names] [Leader]; {'ADAM' 'BOBOS' 'AD AM'} ['AD AM']

For the example the all have have three unique letters. Alpahabetically 'AD AM' precedes 'ADAM' and 'BOBOS'.