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
def max(count):
   m = count[0]
   for i in range(1,len(count)):
       if count[i] > m:
           m = count[i]
   return m
list = []
count = []
mode = 0
for i in range(10):
   count.append(0)
   list.append('m')
for line in sys.stdin.readlines():
   num = int(line)
   if num not in list:
       list[num] = num
       count[num] = count[num] + 1
   else:
       count[num] = count[num] + 1
m = max(count)
for i in range(len(count)):
   if m == count[i]:
       print(list[i])

Python: import sys
array = []
array2 = []
num = 0
for i in sys.stdin.readlines():
    array.append(int(i))
for i in range(len(array)):
    if i == 0:
        a = 0
    elif array.count(array[i]) > a:
        num = array.count(array[i])
        a = array.count(array[i])
for i in range(len(array)):
    if array.count(array[i]) == num:
        array2.append(array[i])
array2 = list(set(array2))
for i in range(len(array2)):
    print(array2[i])

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

Python: mode = []
count = [0 for i in range(100)]
while(1):
	try:
		n = int(input())
		count[n-1] = count[n-1] + 1
	except EOFError:
		max_ = max(count)
		for i in range(100):
			if count[i] == max_:
				mode.append(i+1)
		for i in mode:
			print(i)
		break

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

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

Python: from collections import Counter

c = Counter()

try:
    while 1:
        c[int(input())] += 1
except:
    pass

m = c.most_common(1)[0][1]
r = [n for n in c if c[n] == m]
r.sort()
for v in r:
    print(v)

Python: # 0028
import collections
array = []
while True:
    try:
        a = input()
        if a == '': break
        array.append(int(a))
    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: 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: a = {}

while True:
    try:
        a_i = int(input())
        if a_i in a:
            a[a_i] += 1
        else:
            a[a_i] = 1
    except:
        break

mode_count = max(a.values())

b = []
for key, value in a.items():
    if value == mode_count:
        b.append(key)

print(*sorted(b),sep="\n")

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

Python: from collections import Counter
a = []
while(True):
    try:
        a.append(int(input()))
    except:
        c = Counter(a)
        d = c.most_common()
        print("\n".join(str(e[0]) for e in d if e[1] == d[0][1]))
        break

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: 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: x=[0]*100
while True:
    try:
        y=int(input())
        x[y-1]+=1
    except:
        break
z=max(x)
for i in range(100):
   if x[i] == z:
      print(i+1)

Python: import sys
  
freq = {}

for s in sys.stdin:
    n = int(s.strip())
    if n not in freq:
        freq[n] = 1
    else:
        freq[n] += 1

sortedfreq = sorted(freq.items(), key=lambda x:-x[1])
modes = sorted(filter(lambda x: x[1] == sortedfreq[0][1], sortedfreq), key=lambda x:x[0])
for i in modes:
    print(i[0])

Python: a = {}
while True:
    try:
        a_i = int(input())
        if a_i in a:
            a[a_i] += 1
        else:
            a[a_i] = 1
    except:
        break
mode_count = max(a.values())
b = []
for key, value in a.items():
    if value == mode_count:
        b.append(key)
print(*sorted(b),sep="\n")

Python: import sys
d = {}
for l in sys.stdin.readlines():
    d[int(l)] = d.get(int(l), 0) + 1
l = sorted(d, key=d.get)
n = d[l[-1]]
for x in l:
    if d[x] == n:
        print(x)

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

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

tmp=1
ans=[]
for i in range(100):
    num=0
    for l in range(len(list)):
        if i==list[l]:
            num+=1
    if num>tmp:
        tmp=num
        ans=[i]
    elif num==tmp:
        ans.append(i)
for n in range(len(ans)):
    print(ans[n])

Python: import sys
S = sys.stdin.readlines()
cnt = [0] * 101
for s in S:
    n = int(s)
    cnt[n] += 1
m = max(cnt)
n = cnt.count(m)
p = 0
for i in range(n):
    p = cnt.index(m)
    print(p)
    cnt[p] = 0

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: a = [0] * 100

while True :
    try :
        a[int(input())] += 1
    except :
        break
    
x = max(a)


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

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

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

Python: a = [0]*101

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

    except EOFError:
        break

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

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

C++: #include <stdio.h>

int main(){
    int list[100];
    int data;
    int i;
    int max = 0;
    for(i=0;i<100;i++){
        list[i] = 0;
    }
    while(scanf("%d",&data)!=EOF){
        list[data-1] += 1;
        if(list[data-1]>max)max = list[data-1];
    }
    for(i=0;i<100;i++){
        if(list[i]==max){
            printf("%d\n",i+1);
        }
    }
}