杭电：sort

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

int main()
{
    int odd;
    while(cin >> odd)
    {
        int x;
        vector<int> ivec;
        for(int i = 0; i < odd; ++i)
        {
            cin >> x;
            ivec.push_back(x);
        }
        sort(ivec.begin(), ivec.end());
        int count = 1, max = 0;
        x = ivec[0];
        int i;
        for(i = 1; i < ivec.size(); ++i)
        {
            if(ivec[i] == ivec[i-1])
                ++count;
            else if(count > max)
            {
                max = count;
                x = ivec[i-1];
                if(max >= (odd + 1) / 2)
                    break;
            }
        }
        if(i == ivec.size() && count >= (odd + 1) / 2)
            x = ivec[ivec.size()-1];
        cout << x << endl;
    }
    return 0;
}