#include<bits/stdc++.h>
using namespace std;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())

const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const long long MOD = 1000000007LL;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

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

    map<string, int> mp;
    mp["iti"] = 1;
    mp["ni"] = 2;
    mp["san"] = 3;
    mp["yon"] = 4;

    int n;
    cin >> n;

    vector< pair<string, int> > v(n);
    rep(i, n){
        string t;
        cin >> v[i].first >> t;
        v[i].second = mp[t];
    }

    SORT(v);

    vector<string> u = {"hoge", "iti", "ni", "san", "yon"};
    rep(i, n){
        cout << v[i].first << " " << u[v[i].second] << endl;
    }

    return 0;
}