#include <iostream>
#include <queue>
#include<cstdio>
#include<stdlib.h>
using namespace std;
struct Node{
    char x;
    char y;
    int i;
    Node( int a= 0, int b= 0,int c=0 ):
        x(a), y(b),i(c) {};
};

bool operator<( Node a, Node b ){

    return  a.i>b.i;
}
char s[2],s1,s2;
char ans[10010];
priority_queue<Node> q[13];
int main(){
//freopen("2.out","w",stdout);
int i,j,flag,n;
char l;
cin>>n;
    for(i= 0; i< n; ++i )
    {
        scanf("%s",s);
        s1=s[0],s2=s[1];
        q[s2-'0'-1].push(Node(s1,s2,i));
    }
    j=0;
    for(i=0;i<9;i++)
    {
        flag=0;
        cout<<"Queue"<<i+1<<":";
        while( !q[i].empty() ){
            if(!flag)
            {
                cout << q[i].top().x<< q[i].top().y ;
                flag=1;
            }
            else
                cout <<" "<<q[i].top().x<< q[i].top().y ;
            s1=q[i].top().x;s2=q[i].top().y;
            q[s1-'A'+9].push(Node(s2,s1,j));
            q[i].pop();
            j++;
        }
         cout<<endl;
    }
    j=0;
    for(;i<13;i++)
    {
        flag=0;
        l='A'+i-9;
        cout<<"Queue"<<l<<":";
        while(!q[i].empty())
        {
            if(!flag)
            {
                cout << q[i].top().y<< q[i].top().x;
                flag=1;
            }
            else
                cout <<" "<<q[i].top().y<< q[i].top().x;
            s1=q[i].top().y;s2=q[i].top().x;
            ans[j++]=s1;ans[j++]=s2;
            q[i].pop();
        }
        cout<<endl;
    }
    for(i=0;i<j;i+=2)
    {
        if(i==0)
            cout<<ans[i]<<ans[i+1];
        else
            cout<<" "<<ans[i]<<ans[i+1];
    }
    cout<<endl;
    return 0;
}