#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define MASK(i) (1LL<<(i))
#define BIT(mask,i) (((mask) >> (i))&1LL)
string best_move = "TLZOI";
const ll INF = 1e9;
pll piece[][4]={
{{0,0},{1,0},{-1,0},{0,-1}},
{{0,0},{0,1},{0,2},{1,0}},
{{0,0},{0,1},{-1,1},{1,0}},
{{0,0},{0,1},{1,0},{1,1}},
{{0,0},{0,1},{0,2},{0,3}},
};
ll penalty[5][5];
void cv_to_board(ll state,ll board[5][5]){

    ll ptr = 0;
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++,ptr++){
            board[i][j] = BIT(state,ptr);
        }
    }
}
ll to_state(ll board[5][5]){
    ll res = 0;
    ll ptr = 0;
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++,ptr++){
            res ^= board[i][j]*MASK(ptr);
        }
    }
    return res;
}
ll mx[] = {0,0,1,-1};
ll my[] = {-1,1,0,0};
ll evaluate(ll state){
    if (state<0)return INF;
    ll board[5][5];
    ll res = 0;
    cv_to_board(state,board);
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++){
            res += penalty[i][j] * board[i][j];
        }
    }

    auto valid = [&](pll pnt){
        if (pnt.fi >= 0 && pnt.fi<5 && pnt.se >= 0 && pnt.se<5 && board[pnt.fi][pnt.se]==0)return 1;
        else return 0;
    };
    ll holes = 1;
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++){
            if (board[i][j]==0){
                holes++;
                queue <pll> q;
                q.push({i,j});
                board[i][j] = 1;
                while (!q.empty()){
                    pll u = q.front();
                    q.pop();
                    for (ll k = 0;k < 4;k ++){
                        pll nw = {u.fi+mx[k],u.se+my[k]};
                        if (valid(nw)){
                            q.push(nw);
                            board[nw.fi][nw.se] = 1;
                        }
                    }
                }
            }
        }
    }
    return res*holes;
}
void print_move(ll cur_state,ll nxt_state){
    ll ptr = 0;
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++,ptr++){
            if (BIT(nxt_state,ptr)){
                if (BIT(cur_state,ptr)){
                    cout<<'#';
                }
                else{
                    cout<<'*';
                }
            }
            else{
                cout<<'.';
            }
        }
        cout<<endl;
    }
}
void print_state(ll state){
    ll board[5][5];
    cv_to_board(state,board);
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++){
            cout<<board[i][j];
        }
        cout<<endl;
    }
}
ll f_clear(ll state){
    ll board[5][5];
    cv_to_board(state,board);
    ll row[5]={},col[5]={};
    for (ll i = 0;i < 5;i ++)col[i] = row[i] = 1;
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++){
            col[j] &= board[i][j];
            row[i] &= board[i][j];
        }
    }
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++){
            if (col[j] || row[i])board[i][j] = 0;
        }
    }
    return to_state(board);
}
vector <pll> all_move(ll state,ll type){
    ll board[5][5];
    vector <pll> ans_move;
    cv_to_board(state,board);
    auto valid = [&](pll pnt){
        if (pnt.fi >= 0 && pnt.fi<5 && pnt.se >= 0 && pnt.se<5 && board[pnt.fi][pnt.se]==0)return 1;
        else return 0;
    };
    for (ll flip = 0;flip <= 1;flip++){
        for (ll rot = 0;rot < 4;rot++){
            vector <pll> cur_piece;
            for (ll i = 0;i < 4;i ++){
                pll cur = piece[type][i];
                if (flip){
                    cur.fi = -cur.fi;
                }
                for (ll j = 0;j < rot;j ++){
                    ll x = cur.fi,y = cur.se;
                    cur.fi = y;
                    cur.se = -x;
                }
                cur_piece.push_back(cur);
            }
            for (ll i = 0;i < 5;i ++){
                for (ll j = 0;j < 5;j ++){
                    bool ok = 1;
                    for (ll k = 0;k < 4;k ++){
                        pll cur = cur_piece[k];
                        ok &= valid({cur.fi+i,cur.se+j});
                    }
                    if (ok){
                        for (ll k = 0;k < 4;k ++){
                            pll cur = cur_piece[k];
                            board[cur.fi+i][cur.se+j] = 1;
                        }
                        ll nxt_state = to_state(board);
                        ll end_state = f_clear(nxt_state);
                        ans_move.push_back({nxt_state,end_state});
                        for (ll k = 0;k < 4;k ++){
                            pll cur = cur_piece[k];
                            board[cur.fi+i][cur.se+j] = 0;
                        }
                    }
                }
            }
        }
    }
    return ans_move;
}
pll greedy(ll cur_state,ll type){
    vector <pll> choices = all_move(cur_state,type);
    ll ans_eval = INF;
    pll ans = {-1,-1};
    for (auto x:choices){
        ll val = evaluate(x.se);
        if (val < ans_eval){
            ans = x;
            ans_eval = val;
        }
    }
    return ans;
}
ll DEPTH = 3;
ll plan_ahead(ll cur_state,string coming){
    for (auto x:coming){
        ll type = 0;
        for (ll k = 0;k < sz(best_move);k ++){
            if (best_move[k] == x){type = k;break;}
        }
        cur_state = greedy(cur_state,type).se;
        if (evaluate(cur_state)==INF){
            return cur_state;
        }
    }
    return cur_state;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    string task;
    cin>>task;
    ll ptr = 0;
    for (ll i = 0;i < 5;i ++){
        for (ll j = 0;j < 5;j ++,ptr++){
            ll dist_i = min(abs(i-0),abs(i-4));
            ll dist_j = min(abs(j-0),abs(j-4));
            penalty[i][j] = MASK(dist_i+dist_j);
//            cout<<penalty[i][j]<<' ';
        }
//        cout<<endl;
    }
    if (task == "prepare"){
        ll n;
        cin>>n;
        ll cur_state = 0;
        vector <string> s(n);
        for (auto &x:s)cin>>x;
        for (ll i = 0;i < n;i ++){
            string cur;
            ll best_eval[2];
            best_eval[0] = best_eval[1] = INF;
            function<void(int)> backtrack = [&](int t){
                if(t==n || t == i+DEPTH){
                    ll cur_eval = evaluate(plan_ahead(cur_state,cur));
                    for (ll j = 0;j < 2;j ++)if (cur[0]==s[i][j])best_eval[j] = min(best_eval[j],cur_eval);
                    return;
                }
                for (ll j = 0;j < 2;j ++){
                    cur.push_back(s[t][j]);
                    backtrack(t+1);
                    cur.pop_back();
                }
            };
            backtrack(i);
            ll type[2];
            for (ll j = 0;j < 2;j ++){
                for (ll k = 0;k < sz(best_move);k ++){
                    if (best_move[k] == s[i][j]){type[j] = k;break;}
                }
            }
            pll ans0 = greedy(cur_state,type[0]);
            pll ans1 = greedy(cur_state,type[1]);
//            cout<<"PENDING "<<s[i]<<endl;
            char choose = s[i][0];
            cur_state = ans0.se;
//            cout<<"EVAL "<<best_eval[0]<<' '<<best_eval[1]<<'\n';
            if (best_eval[0]>best_eval[1]){choose = s[i][1];cur_state=ans1.se;}
            if (evaluate(cur_state)==INF)assert(0);
//            cout<<evaluate(cur_state)<<endl;
//            print_state(cur_state);
            cout<<choose;
        }
    }
    else{
        ll n;
        cin>>n;
        ll cur_state = 0;
        while (n--){
            char x;
            cin>>x;
            ll type;
            for (ll i = 0;i < 5;i ++){
                if (x==best_move[i]){
                    type = i;
                    break;
                }
            }
            pll ans=greedy(cur_state,type);
            print_move(cur_state,ans.fi);
            cur_state = ans.se;
//            print_state(cur_state);
        }
    }
}
// 7 10 3 9 8 9 10 11
/*
prepare
88
ZL OL OT IT LO ZL OI ZT TO OI OL OL LZ ZT TL TZ IO ZL TZ TO IL LO ZT OL LT ZI TZ IL LT ZL OT TI ZO ZO ZT OZ TL TL LO OI TO OZ LI ZO ZT ZT IO IZ OZ ZO ZI ZO IO IO TI OL IL IT IL TL TL ZL IT IT ZO IO OL IL ZI TO OL IL ZI LZ LT IL LI ZO IL TL IT LI ZI OL TO OZ IZ OZ
*/