#include <bits/stdc++.h>
using namespace std;
using ll=long long;
map<string,int>mp;
void solve(){
    int n;
    cin>>n;
    string s;
    for(int i=1;i<=n;i++){
        cin>>s;
        mp[s]++;
    }
    vector<pair<string, int>> vec(mp.begin(), mp.end());
    sort(vec.begin(), vec.end(), [](const pair<string, int>& a, const pair<string, int>& b) {
        return a.second > b.second;
    });
    if(vec[0].second>=(n+1)/2){
        cout<<vec[0].first<<endl;
    }else{
        cout<<"uh-oh"<<endl;
    }

}
int main() {
    int t;
//    cin>>t;
//    while(t--)solve();
    solve();
    return 0;
}