import java.util.*;
import java.lang.*;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		String[] S = new String[N];
		for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		int count = 1;
		int countAns = 1;
		int maxium = 0;
		if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

		}
	}
} import java.util.*; util.* java import java.lang.*; lang.* java public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		String[] S = new String[N];
		for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		int count = 1;
		int countAns = 1;
		int maxium = 0;
		if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

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

		int N = sc.nextInt();
		String[] S = new String[N];
		for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		int count = 1;
		int countAns = 1;
		int maxium = 0;
		if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

		}
	} main {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		String[] S = new String[N];
		for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		int count = 1;
		int countAns = 1;
		int maxium = 0;
		if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

		}
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc String[] S = new String[N]; S new String[N] N for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			S[i] = sc.next();
		} {
			S[i] = sc.next();
		} S[i] = sc.next() S[i] S i sc.next() sc.next sc Arrays.sort(S) Arrays.sort Arrays S int count = 1; count 1 int countAns = 1; countAns 1 int maxium = 0; maxium 0 if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

		} N == 1 N 1 {
			System.out.println(S[0]);
		} System.out.println(S[0]) System.out.println System.out System System.out S[0] S 0 {

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

		} for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		} int i=0; int i=0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		} {
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		} if( S[i].equals(S[i+1]) ){
				count++;
			} S[i].equals(S[i+1]) S[i].equals S[i] S i S[i+1] S i+1 i 1 {
				count++;
			} count++ count if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			} !(S[i].equals(S[i+1])) || i==N-2 !(S[i].equals(S[i+1])) (S[i].equals(S[i+1])) S[i].equals S[i] S i S[i+1] S i+1 i 1 i==N-2 i N-2 N 2 {
				maxium = Math.max(count,maxium);
				count = 1;	
			} maxium = Math.max(count,maxium) maxium Math.max(count,maxium) Math.max Math count maxium count = 1 count 1 for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		} int i=0; int i=0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		} {
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		} if( S[i].equals(S[i+1]) ){
				countAns++;
			} S[i].equals(S[i+1]) S[i].equals S[i] S i S[i+1] S i+1 i 1 {
				countAns++;
			} countAns++ countAns if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			} !(S[i].equals(S[i+1])) || i==N-2 !(S[i].equals(S[i+1])) (S[i].equals(S[i+1])) S[i].equals S[i] S i S[i+1] S i+1 i 1 i==N-2 i N-2 N 2 {
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			} if( countAns==maxium ){
					System.out.println(S[i]);
				} countAns==maxium countAns maxium {
					System.out.println(S[i]);
				} System.out.println(S[i]) System.out.println System.out System System.out S[i] S i countAns = 1 countAns 1 if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            } !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 !(S[i].equals(S[i+1])) (S[i].equals(S[i+1])) S[i].equals S[i] S i S[i+1] S i+1 i 1 maxium==1 maxium 1 i==N-2 i N-2 N 2 {
				System.out.println(S[N-1]);              
            } System.out.println(S[N-1]) System.out.println System.out System System.out S[N-1] S N-1 N 1 String[] args args public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		String[] S = new String[N];
		for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		int count = 1;
		int countAns = 1;
		int maxium = 0;
		if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

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

		int N = sc.nextInt();
		String[] S = new String[N];
		for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		int count = 1;
		int countAns = 1;
		int maxium = 0;
		if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

		}
	}
} Main
import java.util.*;
import java.lang.*;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		String[] S = new String[N];
		for( int i=0; i<N; i++ ){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		int count = 1;
		int countAns = 1;
		int maxium = 0;
		if( N == 1 ){
			System.out.println(S[0]);
		}else{

		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				count++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				maxium = Math.max(count,maxium);
				count = 1;	
			}
		}
		for( int i=0; i<N-1; i++ ){
			if( S[i].equals(S[i+1]) ){
				countAns++;
			}
			if( !(S[i].equals(S[i+1])) || i==N-2 ){
				if( countAns==maxium ){
					System.out.println(S[i]);
				}
				countAns = 1;	
			}
			if( !(S[i].equals(S[i+1])) && maxium==1 && i==N-2 ){
				System.out.println(S[N-1]);              
            }              
		}

		}
	}
}