#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    Arrays.sort(types);

    int currentTotal = 0;
    int highestTotal = 0;
    int current = types[0];
    int highest = types[0];


    for(int i = 0; i<types.length; i++){
        if(types[i] == current){
            currentTotal++;

        }
        else{
            current = types[i];
            if(currentTotal > highestTotal){
                highestTotal = currentTotal;
                highest = types[i-1];

            }
            currentTotal = 1;
        }
    }

    System.out.print(highest);
}