#include <bits/stdc++.h>
#define eb emplace_back
#define pb pop_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef tuple<int, int, int> tu;
bool Mbe;

const int N = 1e5 + 100;

int n, ct, c[N];
string s[N], p[N];
map<string, int> id;

void solve() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> s[i];
		if (!id[s[i]]) p[id[s[i]] = ++ct] = s[i];
		c[id[s[i]]]++;
	}
	for (int i = 1; i <= ct; i++) {
		if (c[i] >= (n + 1) / 2) {
			cout << p[i] << '\n';
			return;
		}
	}
	cout << "uh-oh" << '\n';
}

bool Med;
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen("1.in", "r", stdin);
		freopen("1.out", "w", stdout);
	#endif
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}