#include <iostream>
#include <string>
#include <stdio.h>
#include <list>
#include <algorithm>
#include <bitset>
#include <cstring>
#include <stdlib.h>
using namespace std;

struct Substring{
        char subword[2];
        char subnumber;
};

bool compare(const Substring& lhs, const Substring& rhs){
        return lhs.subnumber < rhs.subnumber;
}

int main(){
        int cases=0, i=0;
        cin >> cases;
        while(cases--){
                char* word = (char*)malloc(1001);
                i=0;
                list <Substring> Substringlist;
                list <Substring>::iterator itor;
                itor=Substringlist.begin();
                scanf("%s", word);
                if(strlen(word)>1000 || strlen(word)%2==1){
                        return 0;
                }
                i=0;
                while(*(word+i)!=0){
                        Substring t;
                        t.subword[0]=*(word+i); i++;
                        t.subword[1]=*(word+i); i++;
                        t.subnumber=((t.subword[0]-97)<<4) +(t.subword[1]-97);
 }
                Substringlist.sort(compare);
                for(itor=Substringlist.begin(); itor!=Substringlist.end(); itor++){
                printf("%c%c",itor->subword[0],itor->subword[1]);
                }
                printf("\n");
                free(word);
        }
}