Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	var max int

	numbers := map[int]int{}
	for {
		var a int
		_, err := fmt.Scan(&a)
		if err != nil {
			break
		}
		numbers[a]++
		if numbers[a] >= max {
			max = numbers[a]
		}
	}

	var modes []int
	for a, b := range numbers {
		if b == max {
			modes = append(modes, a)
		}
	}

	sort.Ints(modes)
	for _, mode := range modes {
		fmt.Println(mode)
	}
}

Python: import sys
readlines = sys.stdin.readlines
write = sys.stdout.write
def solve():
    mp = {}
    for line in readlines():
        v = int(line)
        mp[v] = mp.get(v, 0) + 1
    ma = max(mp.values())
    ans = [k for k, v in mp.items() if v == ma]
    ans.sort()
    write("\n".join(map(str, ans)))
    write("\n")
solve()

Python: a = [0] * 100

while 1:
    try:
        n = int(input())
        a[n] += 1
    except:
        break

v = max(a)
for i in range(100):
    if v == a[i]:
        print(i)

Python: # AOJ 0028 Mode Value
# Python3 2018.6.13 bal4u

import sys

cnt = [0 for i in range(101)]
max = 0
for _ in sys.stdin:
	i = int(_)
	cnt[i] += 1
	if cnt[i] > max:
		max = cnt[i]
for i in range(101):
	if cnt[i] == max:
		print(i)

Python: # 0028
import collections
array = []
i = 0
while True:
    try:
        array.append(int(input()))
        i += 1
    except EOFError:
        break
count = list(map(lambda a: array.count(a), array))
modes = list(set(filter(lambda a: array.count(a) == max(count), array)))
print(*modes, sep = '\n')

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

Python: def main():
    Array = [0]*100
    while True:
        try:
            Array[int(input())-1] += 1
        except EOFError:
            break
    [print(i+1) for i in range(100) if Array[i] == max(Array)] 
if __name__ == '__main__':
    main()

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: import sys
from itertools import dropwhile
a = []
for v in sys.stdin:
    a.append(int(v))

m = max([a.count(v) for v in set(a)])
next(dropwhile(lambda x: True, (print(v) for v in set(a) if a.count(v) == m)))

Python: N = []
A = [0 for i in range(100)]

while True :
    try :
        n = int(input())
        N.append(n)
        A[n - 1] += 1
        
    except :
        break
    
m = max(A)

M = [i for i, x in enumerate(A) if x == m]
l = len(M)

for i in range(l) :
    print(M[i] + 1)

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

counts = [0] * 101
# counts[n] nの個数と数える

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

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

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

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

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: 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: # 0028
array = []
while True:
    try:
        a = input()
        if a == '': break
        array.append(int(a))
    except EOFError:
        break
s = set(array)
mx = max(list(map(lambda a: array.count(a), s)))
for a in sorted(s):
    if array.count(a) == mx:
        print(a)

Python: import collections
import itertools
t = []
while True:
    try:
        k=int(input())
        t.append(k)
    except EOFError:
        break
counter = collections.Counter(t)
mode_v=counter.most_common()[0][-1]
it = itertools.takewhile(lambda kv:kv[-1]==mode_v,counter.most_common())
m=(k for k,v in it)
[print(i) for i in m]

Python: import sys
import collections


l = []
for line in sys.stdin:
    l.append(int(line))
counted = collections.Counter(l).most_common()
maxv = counted[0][1]
for k, v in counted:
    if v == maxv:
        print(k)
    else:
        break

Python: n=[0]*101
while 1:
    try:n[int(input())]+=1
    except:break
m_n=max(n)
for i in range(n.count(m_n)):
    print(n.index(m_n)+i)
    n.remove(m_n)

Python: data = [0 for _ in range(100)]

while True:
  try:
    input_data = int(input())
  except EOFError:
    break
  data[input_data-1] += 1

max_piv = max(data)
for i in range(100):
  if data[i] == max_piv:
    print(i+1)

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

counts=[0]*101

for n in a:
    counts[n] +=1
    #print(n)

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

Python: # 0028
array = []
while True:
    try:
        a = input()
        array.append(int(a))
    except EOFError:
        break
s = set(array)
mx = max(list(map(lambda a: array.count(a), s)))
for a in sorted(s):
    if array.count(a) == mx:
        print(a)

Python: a = [0 for i in range(101)]  #101個の0がリストに入ってる
while True:
  try:
    n = int(input())
    a[n] += 1
  except EOFError:
    break
m = 0
for i in range(1, 101):    #最頻値の最頻回数ｍを求めている
  m = max(m, a[i])
for i in range(1, 101): 
    if a[i] == m:          #最頻回数と一致するものをみつけて最頻値を出力
        print(i)

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

num=[]
for i in range(10):
	num.append((A.count(i),i))

num.sort(reverse=True)
mode_value=num[0][0]
B=[]
for i in num:
	if i[0]==mode_value:
		B.append(i[1])
		
B.sort()
for i in B:
	print(i)

Python: from collections import Counter

dic = Counter()

while True:
  try:
    dic[int(input())] += 1

  except EOFError:
    break

lst = dic.most_common()
max_value = lst[0][1]
mode_values = [t[0] for t in lst if t[1] == max_value]
mode_values.sort()

for v in mode_values:
  print(v)

Python: count_map = {}
while True:
    try:
        i = int(input())
        if i in count_map:
            count_map[i] += 1
        else:
            count_map[i] = 1
    except EOFError:
        break
max_count = max(count_map.values())
mode_values = []
for item in count_map.items():
    if item[1] == max_count:
        mode_values.append(item[0])
for mode in sorted(mode_values):
    print(mode)

Python: x=[0]*101
while True :
    try :
        n=int(input())
        x[n]+=1
    except EOFError: break

for i in range(sum(x)):
    if x[i]==max(x) :
        print(i)

Python: # 0028
import collections
array = []
i = 0
while True:
    try:
        array.append(int(input()))
        i += 1
    except ValueError:
        break
count = list(map(lambda a: array.count(a), array))
modes = list(set(filter(lambda a: array.count(a) == max(count), array)))
print(*modes, sep = '\n')

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: 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)