A wildlife research station operates a network of motion-triggered trail cameras and keeps one log per day. Because a camera can fire several times for the very same animal passing by, a species name may be repeated inside a single day's log, but it should only count once toward that day no matter how many times it triggered the camera. Across all logged days, find the species that was recorded on the greatest number of distinct days. If two or more species are tied for the most days, report the one whose name is alphabetically smallest.

Input format

• Line 1: an integer n, the number of logged days.
• The next n lines each describe one day's log: an integer k followed by k space-separated species names recorded that day (a name may repeat within the same day's list).

Output format

Print a single line containing the species name that was recorded on the most distinct days (after removing duplicate entries within each day). Break any tie by printing the alphabetically smallest name among the tied species.

Constraints

• 1 <= n <= 1000
• 1 <= k <= 1000 for every day, and the sum of all k over all days is at most 2 * 10^5
• Each species name consists of 1 to 10 lowercase English letters

3
3 fox owl fox
2 owl deer
1 fox

fox

2
2 cat dog
2 dog cat

cat