Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	return strconv.Atoi(nextString())
}

type Pair struct {
	key   int
	value int
}

func main() {
	scanner.Split(bufio.ScanWords)

	counts := map[int]int{}
	for {
		n, err := nextInt()
		if err != nil {
			break
		}

		counts[n]++
	}

	pairs := []Pair{}
	for k, v := range counts {
		pairs = append(pairs, Pair{k, v})
	}
	sort.Slice(pairs, func(i, j int) bool {
		if pairs[i].value == pairs[j].value {
			return pairs[i].key < pairs[j].key
		}
		return pairs[i].value > pairs[j].value
	})

	vMax := 0
	for _, pair := range pairs {
		if vMax != 0 && vMax != pair.value {
			break
		}
		if pair.value > vMax {
			vMax = pair.value
		}
		fmt.Println(pair.key)
	}
}

Python: # 0028
import collections
array = [0]*100
i = 0
while True:
    try:
        a = input()
        array[i] = int(a)
        i += 1
    except EOFError:
        break
array = filter(lambda a: a != 0, array)
counter = collections.Counter(array).most_common()
for a, count in counter:
    if count < counter[0][1]: break
    print(a)

Python: a, md = [], []
c, mx = 1, 1
while True:
    try:
        a.append(int(input()))
    except EOFError:
        break
a = sorted(a)
print(a)
for i in range(0, len(a) - 1):
    if a[i] == a[i + 1]:
        c += 1
    else:
        c = 1
    if mx < c:
        mx = c
        md = [a[i]]
    elif mx == c:
        md.append(a[i])
print('\n'.join(map(str, md)))

Python: import sys
a=[0]*101
for i in sys.stdin:a[int(i)]+=1
[print(i)for i in range(101)if a[i]==max(a)]

Python: import sys

c = [0]*101
while True:
	try:
		c[int(input())] += 1
	except EOFError:
		break
    	
max = max(c)
for i in range(101):
	if c[i] == max:
		print(i)

Python: numdict = dict()
while True:
	try:
		num = input()
		if num not in numdict:
			numdict[num] = 0
		else:
			numdict[num] += 1
	except EOFError:
		break
most = max(numdict.values())
for key in numdict:
	if most == numdict[key]:
		print(key)

Python: a=[]
try:
    while True:
        a.append(int(input()))
except EOFError:
    pass

counts=[0]*101

for n in a:
    counts[n] += 1

for n in range(len(a)):
    if counts[n]==max(counts):
        print(n)

Python: c=[0]*101
while True:
    try :
        a=int(input())
        c[a]+=1
    except EOFError :
        break
    
max=max(c)
for i in range(101):
    if c[i]==max:
        print(i)

Python: a=[]
while True:
    try:
        x=int(input())
        a.append(x)
    except:
        break
b=[]
for i in range(1,101):
    y=a.count(i)
    b.append(y)
c=[j for j, v in enumerate(b) if v == max(b)]
e=len(c)
for h in range(e):
    print(c[h]+1)

Python: A = []
while True:
    try:
        A.append(int(input()))
    except EOFError:
        break

cnt = [0] * 101
for i in A:
    cnt [i] += 1

mx = max(cnt)

for i in range(1,101):
    if cnt [i] == mx:
        print(i)

Python: import sys
a={}
for i in sys.stdin:a.setdefault(i,0);a[i]+=1
for k in a:
 if a[k]==max(a.values()):print(k.strip())

Python: import collections
import sys
cntr = collections.Counter()
for line in sys.stdin:
    cntr[int(line)] += 1
lst = []
for k,v in cntr.items():
    lst.append((v,k))
lst.sort()
t = len(lst)-1
while t>0 and lst[t][0] == lst[t-1][0]:
    t -= 1
for i in range(t,len(lst)):
    print(lst[i][1])

Python: memo, max_value = {}, 0
while True :
    try :
        temp = input()
        if temp in memo : memo[temp] = memo[temp] + 1
        else : memo[temp] = 1
        if max_value < memo[temp] : max_value = memo[temp]
    except : break
temp = []
for result, value in memo.items() :
    if max_value == value : temp.append(result)
temp.sort()
for _ in temp : print(_)

Python: a = []
try :
    while True:
        a.append(int(input()))
except EOFError:
    pass
counts = [0] * 101
for n in a:
    counts[n] += 1
for n in range(len(a)):
    if counts[n] == max(counts):
        print(n)

Python: x=[]
while True:
    try:
        n=int(input())
        x.append(n)
    except:
        break

c=[0]*101
for i in x:
    c[i]+=1
b=max(c)

for j in range(100):
    if c[j]==b:
        print(j)

Python: # -*- coding: utf-8 -*-

DICT = {k: 0 for k in range(1, 101)}


def solve(d):
    l = []
    _max = max(d.values())
    for k, v in sorted(d.items()):
        if _max == v:
            l.append(k)
    print('\n'.join(str(e) for e in l), end='')

if __name__ == '__main__':
    while True:
        try:
            n = int(input())
            DICT[n] += 1
        except:
            break

    solve(DICT)

Python: a=[0]*100
while 1:
  try:
    a[int(input())-1]+=1
  except:
    break
[print(i+1)for i in range(100)if a[i]==max(a)]

Python: import sys

d = {i:0 for i in range(1,101)}
for i in map(int, sys.stdin):
    d[i] += 1
s = sorted(d.items(), key=lambda x: x[1], reverse=True)
m = s[0][1]
for i in s:
    if i[1] < m:
        break
    print(i[0])

Python: 
a = [0]*101

while True:
    try:
        n = int(input())
        a[n] += 1
    except:
        break
    
for i in range(1,101):
    if a[i] == max(a):
        print(i)

Python: l=[0]*101
while True:
    try:
        i=int(input())
        l[i]+=1
    except:
        break
M=max(l)
for j in range(1,101):
    if l[j]==M:
        print(j)
    else:
        pass

Python: import sys

count = [0 for _ in range(101)]
mode = [0]

for s in sys.stdin:
    x = int(s)
    count[x] += 1

for i in range(len(count)):
    if count[i] > mode[0]:
        mode.clear()
        mode.append(i)
    elif count[i] == mode[0]:
        mode.append(i)

for i in mode:
    print(i)

Python: import collections
a = []
while True:
    try:
        n = int(input())
    except EOFError:
        break
    a.append(n)
    
if len(a) != 0:
    b = collections.Counter(a)
    c = b.most_common()
    x = c[0][1]
    d = []
    for elem in c:
        if elem[1] == x:
            d.append(elem[0])
        else:
            break
    d.sort()
    [print(k) for k in d]

Python: # 0028
import collections
array = [0]*100
i = 0
while True:
    a = input()
    if a == '': break
    array[i] = int(a)
    i += 1
array = filter(lambda a: a != 0, array)
counter = collections.Counter(array).most_common()
for a, count in counter:
    if count < counter[0][1]: break
    print(a)

Python: a = [0] * 101
while True:
    try:
        a[int(input())] += 1
    except:
        break
maxv = max(a)
for i, v in enumerate(a):
    if maxv == v:
        print(i)

Python: lst=[]
while True:  
    try:
        n=int(input())
        lst.append(n)
    except EOFError:
        break
        continue
import collections
c = collections.Counter(lst)  
freqCheck = c.most_common()
mode =[freqCheck[0][0]]
maxCount = freqCheck[0][1] 
count = 1
while maxCount == freqCheck[count][1]:
    mode.append(freqCheck[count][0])
    count = count + 1
mode.sort()
for i in mode:
    print(i)

Python: a=[]
try:
    while True:
        a.append(int(input()))
except EOFError:
    pass

counts = [0]*101
for n in a:
    counts[n] += 1

for n in range(len(a)):
    if counts[n] == max(counts):
        print(n)

Python: # -*- coding: utf-8 -*-

DICT = {k: 0 for k in range(0, 10)}


def solve(d):
    _max = max(d.values())
    for k, v in d.items():
        if _max == v:
            print(k)

if __name__ == '__main__':
    while True:
        try:
            n = int(input())
            DICT[n] += 1
        except:
            break

    solve(DICT)

Python: a=[]
c=[]
while True:
    try:
        a.append(int(input()))
    except:
        break
x=len(a)
for i in range(x):
    b=a.count(i)
    c.append(b)
r=max(c)
e=len([i for i,x in enumerate(c) if x==r])
d=[i for i,x in enumerate(c) if x==r]
for i in range(e):
    print(d[i])