import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        Map<String, Integer> m = new HashMap<>(n);
        for(int i=0; i<n; i++) {
            String s = in.next();
            if(m.containsKey(s)) {
                m.put(s, m.get(s)+1);
            }
            else {
                m.put(s, 1);
            }
        }
        Set<String> keySet = m.keySet();
        int maxCount = 0;
        Iterator<String> it = keySet.iterator();
        while(it.hasNext()) {
            String s = it.next();
            int c = m.get(s);
            maxCount = Math.max(maxCount, c);
        }
        it = keySet.iterator();
        SortedSet<String> results = new TreeSet<>();
        while(it.hasNext()) {
            String s = it.next();
            int c = m.get(s);
            if(c==maxCount) {
                results.add(s);
            }
        }

        it = results.iterator();
        while(it.hasNext()) {
            System.out.println(it.next());
        }
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz