We have N voting papers. The i-th vote (1 \leq i \leq N) has the string S_i written on it.

Print all strings that are written on the most number of votes, in lexicographical order.

Constraints

* 1 \leq N \leq 2 \times 10^5
* S_i (1 \leq i \leq N) are strings consisting of lowercase English letters.
* The length of S_i (1 \leq i \leq N) is between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:


N
S_1
:
S_N


Output

Print all strings in question in lexicographical order.

Examples

Input

7
beat
vet
beet
bed
vet
bet
beet


Output

beet
vet


Input

8
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo


Output

buffalo


Input

7
bass
bass
kick
kick
bass
kick
kick


Output

kick


Input

4
ushi
tapu
nichia
kun


Output

kun
nichia
tapu
ushi
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.TreeMap;

public class Main {

	public static void main(String args[]) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int n = Integer.parseInt(br.readLine());

		TreeMap<String, Integer> map = new TreeMap<>();
		HashSet<String> set = new HashSet<>();
		int max = 0;
		for (int i = 0; i < n; i++) {
			String str = br.readLine();
			if (map.containsKey(str)) {
				map.put(str, map.get(str) + 1);
				max = Math.max(max, map.get(str));
			} else {
				map.put(str, 1);
				max = Math.max(max, map.get(str));
			}
		}

		for (String s : map.keySet()) {
			if (map.get(s) == max) {
				System.out.println(s);
			}
		}
	}
}
