hdu-1004

http://acm.hdu.edu.cn/showproblem.php?pid=1004

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Problem1004 {

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

        while(input.hasNext()){
            int caseNum = input.nextInt();
            if(caseNum!=0){
                Map<String, Integer> map = new HashMap<String, Integer>();
                int count = 0;
                for(int i =0;i<=caseNum;i++){
                    String word = input.nextLine();
                    map.put(word, count++);
                }
                int max = Integer.MIN_VALUE;
                //String[] arry= {};
                for(String key:map.keySet()){
                    int num = map.get(key);
                    if(num > max){
                        max = num;
                    }

                }
                for(String key:map.keySet()){
                    if(map.get(key)==max){
                        System.out.println(key);
                    }
                }
            }else{
                //input.close();
                break;
            }

        }
    }

}