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: # coding: utf-8
# 50
import collections

S = list()
for i in range(100):
    try:
        S.append(int(input()))
    except:
        break

A = list()

for j in range(len(collections.Counter(S).most_common())):
    if collections.Counter(S).most_common()[0][1] == collections.Counter(S).most_common()[j][1]:
        A.append(collections.Counter(S).most_common()[j][0])
A.sort()       
for z in range(len(A)):
    print(A[z])

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

Python: import sys
 
def ModeValue():
    mode=[0 for i in range(0,101)]
    
    for n in sys.stdin:
        mode[int(n)]+=1

    maxN=max(mode)

    for i in range(0,101):
        if mode[i]==maxN:
            print(i)
            
ModeValue()

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

Python: import collections as co
a = []
while True:
    try:
        n = int(input())
    except:
        break
    a.append(n)
b = co.Counter(a)
c = b.most_common()
N = c[0][1]
maxs =[]
for c2 in c:
    if c2[1] == N:
        maxs.append(c2[0])
    maxs.sort()
d = len(maxs)
for j in range(d):
    print(maxs[j])

Python: import sys
from collections import defaultdict
d = defaultdict(int)
for i in sys.stdin:
    d[i] +=1
m = max(v for v in d.values())
for _ in sorted([k for k, v in d.items() if v == m]):
    print(_)

Python: import sys
from collections import defaultdict
d = defaultdict(int)
for i in sys.stdin:
    d[int(i)] +=1
m = max(v for v in d.values())
for i in sorted([k for k, v in d.items() if v == m]):
    print(i)

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

num=[]
for i in range(101):
	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: import sys
a = {}
ma = 0
m = []
for u in sys.stdin:
    i = int(u)
    if not (i in a):
        a[i] = 1
    else:
        a[i] += 1
    # ???????????§????????±???
    if ma <= a[i]:
        if ma < a[i]:
            ma = a[i]
            m.clear()
        m.append(i)
m = sorted(m)
for k in m:
    print(k)

Python: # 0028
array = []
while True:
    try:
        a = input()
        array.append(int(a))
    except EOFError:
        break
count = list(map(lambda a: array.count(a), set(array)))
modes = [array[i] for i, x in enumerate(count) if x == max(count)]
print(*sorted(modes), sep = '\n')

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

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
 
count = [0 for _ in range(101)]
mode = 0
 
for s in sys.stdin:
    x = int(s)
    count[x] += 1
    mode = max(mode, count[x])
 
for i in range(101):
    if count[i] == mode:
        print(i)

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

Python: # Aizu Problem 0028: Mode Value
#
import sys, math, os

# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
    sys.stdin = open("sample-input.txt", "rt")


counts = {}
while True:
    try:
        a = int(input())
    except EOFError:
        break
    counts[a] = counts.get(a, 0) + 1

for a in sorted([a for a in counts if counts[a] == max(counts.values())]):
    print(a)

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

Python: # coding: utf-8
import sys

d = {}
for line in sys.stdin:
    s = line.strip()
    if not s in d: 
        d[s] = 1
    else:
        d[s] += 1

max_num = max(d.values())

ans = [int(key) for key, value in d.items() if value == max_num]
for i in sorted(ans):
    print(i)

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

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


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

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: 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
import collections
array = []
i = 0
while True:
    try:
        a = input()
        array.append(int(a))
        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 = []
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: from collections import Counter
l=[0]*100

while True:
    try:
        x=int(input())
        l[x+1]+=1
    except:
        break
    
for i in range(100):
    if l[i]==max(l):
        print(i-1)
    else:
        pass

Python: from collections import Counter
l = []
while True:
    try:
        a=int(input())
    except EOFError:
        break
    l.append(a)
L = sorted(l)
def calculate_mode(L):
    c = Counter(L)
    freq_scores = c.most_common()
    max_count = freq_scores[0][1]

    modes = []
#出現回数と最大出現回数が等しいかを確認します。
    for num in freq_scores:
        if num[1] == max_count:
            modes.append(num[0])
    return(modes)

if __name__ == '__main__':
    data = L
    modes = calculate_mode(L)

    for mode in modes:
        print(mode)

Python: a={}
maxnum = 1
while True:
    try:
        ai = int(input())
        if ai not in a:
            a[ai] = 1
        else:
            a[ai] += 1
            if maxnum < a[ai]:
                maxnum = a[ai]
    except:
        break
b = sorted(a.items())
for key, value in b:
    if maxnum==value:
        print(key)