import java.util.*;

public class Main {

    public static void main(String []args){
        Scanner in = new Scanner(System.in);

        int n;
        n = in.nextInt();

        SortedMap<String,Integer> poll = new TreeMap<String, Integer>();

        int maxvote = 0;
        for(long i=0;i<n;i++)
        {
            String candidate = in.next();
            if(poll.containsKey(candidate))
            {
                poll.put(candidate,poll.get(candidate)+1);
            }
            else{
                poll.put(candidate,1);
            }
            maxvote = Math.max(maxvote,poll.get(candidate));
        }

        for(String candidate:poll.keySet())
        {
            if(poll.get(candidate)==maxvote)
                System.out.println(candidate);
        }

    }

}

/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