C++ :

#include<bits/stdc++.h>
using namespace std;
map<string,int> a;
int n;
string s;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>s;
		if(a.count(s)==0)
		{
			a[s]=1;
		}else a[s]++;
		
	}
	map<string,int>::iterator it=a.begin();
	cout<<it->first;
	return 0;
}

Pascal :

var

        a:array[0..15000] of string;

        b:array[0..15000] of longint;

        n,i,num,j,max:longint;

        s,maxs:string;

 

 

begin

        readln(n);

        for i:=1 to n do

        begin

                readln(s);

                num:=0;

                for j:=1 to length(s) do

                num:=num+ord(s[j])*j;

                if a[num]='' then

                a[num]:=s;

                inc(b[num]);

                if b[num]>=max then

                begin

                        max:=b[num];

                        maxs:=s;

                end;

        end;

        writeln(maxs);

end.

Python :

import math
import sys
# n,m=list(map(int,input().split()))
d=dict()
n=int(input())
for i in range(n):
    k=input()
    if k not in d:
        d[k]=0
    else:
        d[k]=d[k]+1

slist = sorted(d.items(),key=lambda x :-x[1])
print(slist[0][0])