Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	table := make([]int, 100)
	now := 0
	max := 0
	for i := range table {
		table[i] = 0
	}
	for scanner.Scan() {
		now, _ =strconv.Atoi(scanner.Text())
		table[now-1]++
		if table[now-1] > max {
			max = table[now-1]
		}
	}
	for i := 0; i < 100; i++ {
		if table[i] == max {
			fmt.Println(i+1)
		}
	}
}

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

Python: #数字の数を求めるためのリストを作成する
num_list = [0 for i in range(101)]

#"EOFError"がくるまで入力を繰り返し、入力の番号のインデックスを1ふやす
try:
    while True:
        num_list[int(input())] += 1
except EOFError:
    
    #最瀕値の数が出てきた数を変数に代入し最瀕値であれば出力する
    i = max(num_list)
    for j in range(1,101):
        if num_list[j] == i:print(j)

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

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

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

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

Python: import sys
from collections import Counter
v = Counter([int(i) for i in sys.stdin.readlines()]).most_common()
j = [print(i) for i in sorted([k for k, l in v if l == v[0][1]])]

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(str(e) for e in l), end='')

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

    solve(DICT)

Python: import operator
h = {}   
while True:
    try:
        i = int(input())
        if i in h:
            h[i] += 1
        else:
            h[i] = 0
    except EOFError:
        break

h1=sorted(h.items(),key=operator.itemgetter(1),reverse=1)
val = h1[0][1]
h2 = sorted(filter(lambda x:x[1]==val, h1))
for i in h2:
    print(i[0])

Python: # AOJ 0028 Mode Value
# Python3 2018.6.13 bal4u

import sys

cnt = [0]*101
while True:
	try:
		cnt[int(input())] += 1
	except EOFError:
		break
    	
max = max(cnt)
for i in range(101):
	if cnt[i] == max:
		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

###
### for atcorder program
###

import sys
import math

# math class
class mymath:
    ### pi
    pi = 3.14159265358979323846264338

    ### Prime Number
    def pnum_eratosthenes(self, n):
        ptable = [0 for i in range(n+1)]
        plist = []

        for i in range(2, n+1):
            if ptable[i]==0:
                plist.append(i)
                for j in range(i+i, n+1, i):
                    ptable[j] = 1
        return plist

    ### GCD
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

    ### LCM
    def lcm(self, a, b):
        return (a*b)//self.gcd(a,b)

    ### Mat Multiplication
    def mul(self, A, B):
        ans = []
        for a in A:
            c = 0
            for j, row in enumerate(a):
                c += row*B[j]
            ans.append(c)
        return ans

mymath = mymath()

### output class
class output:
    ### list
    def list(self, l):
        l = list(l)
        #print(" ", end="")
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()

### input sample
#i = input()
#N = int(input())
#A, B, C = [x for x in input().split()]
#N, K = [int(x) for x in input().split()]
#inlist = [int(w) for w in input().split()]

#R = float(input())
#A.append(list(map(int,input().split())))

#for line in sys.stdin.readlines():
#    x, y = [int(temp) for temp in line.split()]

#abc list
#abc = [chr(ord('a') + i) for i in range(26)]

### output sample
#print("{0} {1} {2:.5f}".format(A//B, A%B, A/B))
#print("{0:.6f} {1:.6f}".format(R*R*math.pi,R*2*math.pi))
#print(" {}".format(i), end="")

def get_input():
    N = []
    while True:
        try:
            #N.append(input())
            N.append(int(input()))
        except EOFError:
            break
    return N

A = get_input()

N = []
maxnum = -1

for i in A:
    count = 0
    for j in A:
        if i == j:
            count += 1
    if maxnum < count:
        maxnum = count
        N = [i]
    elif maxnum == count:
        N.append(i)

N = set(N)
N = sorted(N)

for i in N:
    print(i)

Python: from sys import stdin
from collections import Counter
data = Counter([i for i in range(1, 101)])
for line in stdin:
    data[int(line.replace('\n', ''))] += 1
mode = data.most_common(1)[0][1]

for po in range(1, 101):
    if data[po] == mode:
        print(po)
    else:
        pass

Python: h = {}
while True:
	try:
		a = int(input())
		if a in h:
			h[a] += 1
		else:
			h[a] = 1
	except EOFError:
		break
#print(h)
l = [(mode, 10000 - num) for num, mode in h.items()]
l.sort(reverse=True)
max_mode, num = l[0]
print(10000 - num)
for i in range(1,1000):
	if l[i][0] != max_mode: break
	mode, num = l[i]
	print(10000-num)

Python: # coding: utf-8
# Your code here!

l = [0] * 110

while True:
   try:
      n = int(input())
      l[n] += 1
   except EOFError:
      break

m = max(l)
for i in range(1, 101):
   if l[i] == m:
      print(i)

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

import sys
import os
import datetime

d = {}
for s in sys.stdin:
    v = int(s)

    if v not in d:
        d[v] = 1
    else:
        d[v] += 1

max_value = max(d.values())

for key in d.keys():
    if d[key] == max_value:
        print(key)

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


count=[0]*101
for n in list:
    count[n]+=1



for n in range(len(list)):
    if count[n]==max(count):
        print(n)

Python: a = list([0] * 100)

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

Python: 
import sys
arr = {}
for i in sys.stdin:
    if int(i) in arr:
        arr[int(i)] += 1
    else:
        arr[int(i)] = 1
max = 0
ans = []
for i in arr.keys():
    if arr[i] > max:
        ans = [i]
        max = arr[i]
    elif arr[i] == max:
        ans.append(i)
for i in ans:
    print(i)

Python: import sys

def ModeValue():
    mode=[0 for i in range(0,101)]

    try:
        for n in sys.stdin:
            mode[int(n)]+=1
    except EOFError:
            a=1  
    maxN=max(mode)

    for i in mode:
        if mode[i]>maxN:
            print(i)
            
ModeValue()

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 = list(filter(lambda a: array.count(a) == max(count), set(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)