/*
Author: haze
2023/11/15
09:58
*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int (i) = (l); (i) <= (r); ++(i))
#define drep(i, r, l) for(int (i) = (r); (i) >= (l); --(i))
#define ll long long
#define LL __int128
using namespace std;

inline ll read() {
    char ch = getchar();
    ll s = 0;
    bool w = 0;
    while (!isdigit(ch)) {
        if (ch == '-')w = 1;
        ch = getchar();
    }
    while (isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
    return w ? -s : s;
}

inline char rc() {
    char ch = getchar();
    while (1) {
        if (ch >= '!' && ch <= '~')return ch;
        ch = getchar();
    }
}

template<class T1, class T2>
T1 min(T1 AA, T2 BB) { return AA > BB ? BB : AA; }

template<class T1, class T2>
T1 max(T1 AA, T2 BB) { return AA < BB ? BB : AA; }

const int itinf = 1e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;
map<string, string> f =
        {
                {"shimasu", "shite"},
                {"gimasu", "ide"},
                {"chimasu", "tte"},
                {"rimasu", "tte"},
                {"mimasu", "nde"},
                {"bimasu", "nde"},
                {"nimasu", "nde"},
                {"kimasu", "ite"}

        };
int main() {
    int n = read();
    while(n --){
        string s, t;
        cin >> s;
        if(s == "ikimasu"){
            puts("itte");
            continue;
        }
        while(s.size()){
            if(f.contains(s)){
                cout << t << f[s] << '\n';
                break;
            }
            t += s[0];
            s.erase(s.begin());
        }
    }
    return 0;
}