#include <bits/stdc++.h>
using i64 = long long;
using namespace std;
const int N = 2e5 + 5;

void solve()
{
    int n, mx = 0;
    cin >> n;
    map<string, int> cnt;
    for (int i = 1; i <= n; i++)
    {
        string s;
        cin >> s;
        cnt[s]++;
        mx = max(mx, cnt[s]);
    }
    vector<string> ans;
    for (auto[x, y] : cnt)if (y == mx) ans.push_back(x);
    if (ans.size() == 1) cout << ans[0];
    else cout << "uh-oh";
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}