#include <stdio.h>
#include <string.h>

void swap (char* pre1, char* pre2, char* set1, char* set2);
void qSort (char* str, int start, int end);
int qPartitionSort (char* str, int start, int end);


int main () {
    int cases;
    char str[1024];
    scanf("%d", &cases);

    while (cases--) {
        scanf("%s", str);
        qSort(str, 0, strlen(str)-2);
        printf("%s", str);
    }
    return 0;
}

void swap (char* pre1, char* pre2, char* set1, char* set2) {
    char* temp;
    temp = pre1;
    pre1 = set1;
    set1 = temp;
    temp = pre2;
    pre2 = set2;
    set2 = temp;

    return;
}

void qSort (char* str, int start,  int end) {
    int pivot = 0;
    if (start < end) {
        pivot = qPartitionSort (str, start, end);
        qSort (str, start, pivot-2);
        qSort (str, pivot+2, end);
    }
}

int qPartitionSort (char* str, int start, int end) {
    int pivot = 0;
    int left = 0, right = 0;

    left = start;
    right = end;
    pivot = end;

    while (left < right) {
        while (*(str + left) < *(str + pivot) || (*(str + left) == *(str + pivot) && *(str + left + 1) < *(str + pivot + 1)) && left > right) {
            left += 2;
        }
        while (*(str + left) > *(str + pivot) || (*(str + left) == *(str + pivot) && *(str + left + 1) >= *(str + pivot + 1)) && left < right) {
            right -= 2;
        }
        if (left < right) {
            swap (str+left, str + left + 1, str + right, str + right + 1);
        }
        swap (str + pivot,  str + pivot + 1, str + right, str + right + 1);
    }
    return right;
}