#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define inf 0x3f3f3f3f
#define endl '\n'
using namespace std;

int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};

template <typename T>
void MAX(T &a, T b) { a = max(a, b); }

template <typename T>
void MIN(T &a, T b) { a = min(a, b); }

template <typename T>
T lowbit(T x) { return x & -x; }

template <typename T>
int getlen(T x)
{
    int res = 0;
    while (x)
    {
        ++res, x /= 10;
    }
    return res;
}

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = x * 10 + ch - 48;
        ch = getchar();
    }
    return x * f;
}

void solve()
{
    int n;
    cin >> n;

    map<string, vector<string>> a;
    while (n--)
    {
        string name, id, op;
        cin >> name >> id >> op;

        if (op[0] == 'a')
        {
            a[id].push_back(name);
        }
    }

    string mx = "";
    for (auto &[k, vec] : a)
    {
        sort(vec.begin(), vec.end());
        vec.erase(unique(vec.begin(), vec.end()), vec.end());

        if (a[mx].size() < a[k].size())
        {
            mx = k;
        }
    }

    cout << mx << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int T = 1;
    //   cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}