//KY258 编排字符串
#include <iostream>
#include <algorithm>
#include <cstring>
#include <stack>
using namespace std;
int n;
stack<string>s, s1;
int main()
{
    cin>>n;
    string m;
    for(int i=1;i<=n;i++){
        cin>>m;
        s.push(m);
        s1=s;
        for(int i=1;i<=4;i++){
            if(s1.empty()) break;
            cout<<i<<"=";
            cout<<s1.top()<<" ";
            s1.pop();
        }
        cout<<"\n";
    }
    return 0;
}