#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    string num[] = {"iti", "ni", "san", "yon"};
    ll n;
    cin >> n;
    vector<pair<string, ll>> book(n);
    rep(i, n) {
        string s;
        cin >> book[i].first >> s;
        rep(j, 4) {
            if (num[j] == s) {
                book[i].second = j;
            }
        }
    }
    sort(all(book));
    rep(i, n) {
        printf("%s %s\n", book[i].first.c_str(), num[book[i].second].c_str());
    }
    return 0;
}