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

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
template<typename V> constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  int s = 0;
  vi t(101);
  int a;
  while (cin >> a) t[a]++, cmax(s, t[a]);
  rep(i, 101) if (t[i] == s) cout << i << endl;
}

C++: #include <iostream>
#include <map>

using namespace std;

void solve()
{
	map<int, int> Map;
	int n;
	while(~scanf("%d", &n))
	{
		++Map[n];
	}
	int Max = 0;
	for(map<int, int>::iterator Ite = Map.begin(); Ite != Map.end(); ++Ite)
	{
		if(Max < Ite->second)
		{
			Max = Ite->second;
		}
	}
	for(map<int, int>::iterator Ite = Map.begin(); Ite != Map.end(); ++Ite)
	{
		if(Ite->second == Max)
		{
			cout << Ite->first << endl;
		}
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include <bits/stdc++.h>

using namespace std;

int main()
{
	int num;
	int bucket[101] = {0};
	int max = 0;
	
	while (scanf("%d", &num) != EOF){
		bucket[num]++;
	}
	
	for (int i = 1; i <= 100; i++){
		if (bucket[i] > max) max = bucket[i];
	}
	
	for (int i = 1; i <= 100; i++){
		if (max == bucket[i]) cout << i << "\n";
	}
	
	return (0);
}

C++: #include <iostream>

using namespace std;

int main()
{
    int n[101]={0};
    int buf;
    while(cin>>buf)
    {
        n[buf]++;
    }
    int b=0;
    for(int i=0;i<101;++i){
        if(n[i]>b)b=n[i];
    }
    for(int i=0;i<101;++i){
        if(n[i]==b)cout<<i<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main( void )
{
	vector <int> cnt( 101, 0 );
	int max_value = 0;
	while ( !cin.eof() )
	{
		int n;
		cin >> n;
		if ( cin.eof() )
			break;
		cnt[n]++;
		max_value = max( cnt[n], max_value );
	}

	for ( int i = 1; i <= 100; i++ )
	{
		if ( cnt[i] == max_value )
		{
			cout << i << endl;
		}
	}

	return 0;
}

C++: #include <iostream>
#include <cstring>
using namespace std;

int main(){
  int n;
  int mode[101];
  memset(mode,0,sizeof(mode));
  int a = 0;
  while(cin >> n){
    mode[n]++;
    a = max(a,mode[n]);
  }
  for(int i=0; i<101; i++){
    if(mode[i] == a)
      cout << i << endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;

int main() {
	int z[100]={},max=0,i;
	
	while(cin>>i){
		++z[i-1];
		
		if(z[i-1] > max)max = z[i-1];
	}
	
	for(i=0;i<100;++i){
		if(z[i]==max)cout<<i+1<<endl;
	}
	
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#define N 101
using namespace std;

int main(){

  int i, m, a[N] = {};
  while(cin >> i)
    a[i]++;

  for(int j = 1; j < N; j++) 
    m = max(m,a[j]);

  for(int k = 1; k < N; k++)
    if(a[k] == max) 
      cout << k << "\n";
  
}

C++: #include <iostream>
using namespace std;
int main() {
	int n, count = 0;
	int array[100];
	for(int i = 0; i < 100; i++) {
		array[i] = 0;
	}
	while(cin >> n) {
		array[n - 1]++;
		if(count < array[n - 1]) {
			count = array[n - 1];
		}
	}
	for(int i = 0; i < 100; i++) {
		if(count == array[i]) {
			cout << i + 1 << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    int n[101];
    int i;
    for( i = 0;i < 101;i++){
        n[i] = 0;
        
    }
    for( i = 1;i != 0;i){
        i = 0;
        cin  >> i;
        n[i]++;
    }
    int max = 1;
    for( i = 2;i < 101;i++){
       
        if(n[max] <= n[i]){
            max = i;
            
        }
    }
    for( i = 1;i < 101;i++){
        if(n[i] == n[max]){
            cout << i <<endl;
        }
    }
    return 0;

}

C++: #include<bits/stdc++.h>
using namespace std;

int cnt[100];
int main(){
    int n,ma=0;

    while(cin>>n)ma=max(ma,++cnt[--n]);

    for(int i=0;i<100;i++)
        if(cnt[i]==ma)cout<<i+1<<endl;

   return 0;
}

C++: #include <iostream>
#include <map>
#include <set>

int main()
{
	std::map<int, int> counter;
	int number;
	while (std::cin >> number) {
		counter[number]++;
	}

	int max_count = 0;
	std::set<int> max_numbers;
	for (std::map<int, int>::iterator i = counter.begin(); i != counter.end(); ++i) {
		if (i->second >= max_count) {
			if (i->second > max_count) {
				max_count = i->second;
				max_numbers.clear();
			}
			max_numbers.insert(i->first);
		}
	}

	for (std::set<int>::iterator i = max_numbers.begin(); i != max_numbers.end(); ++i) {
		std::cout << *i << std::endl;
	}

	return 0;
}

C++: #include <stdio.h>

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

C++: #include <bits/stdc++.h>
using namespace std;

int num[101];

int main() {
  int n;
  while ( cin >> n ) num[n]++;
  int maxn = 0;
  for ( int i = 1; i < 101; i++ ) maxn = max(maxn,num[i]);
  for ( int i = 1; i < 101; i++ ) {
    if ( num[i] == maxn ) cout << i << endl;
  }

  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class Dat
{
public:
  int num, frq;
  Dat():num(0), frq(0) {}
};

class GreaterFrq
{
public:
  bool operator()(const Dat& lhs, const Dat& rhs)
  {
    if (lhs.frq == rhs.frq)
      return lhs.num < rhs.num;
    return lhs.frq > rhs.frq;
  }
};

int main()
{
  int in;
  vector<Dat> dat(100+1);
  while (cin >> in) {
    dat[in].num = in;
    ++dat[in].frq;
  }

  sort(dat.begin(), dat.end(), GreaterFrq());

  int f = dat.front().frq;
  for (int i = 0; i < dat.size(); ++i) {
    if (f == dat[i].frq)
      cout << dat[i].num << endl;
  }

  return 0;

}

C++: #include<iostream>
using namespace std;

int main() {
	int datas[100] = { 0 };
	int num,biggest_num=0;
	while (cin >> num) {
		datas[num-1]++;
	}
	for (int i = 0; i < 100; i++) {
		if (biggest_num < datas[i]) {
			biggest_num = datas[i];
		}
	}
	for (int i = 0; i < 100; i++) {
		if (biggest_num == datas[i]) {
			cout << i + 1<<endl;
		}
	}
	return 0;
}