A string b is a subsequence of a string a if b can be obtained from a by deletion of several (possibly, zero or all) characters. For example, "xy" is a subsequence of "xzyw" and "xy", but not "yx".

You are given a string a. Your task is to reorder the characters of a so that "trygub" is not a subsequence of the resulting string.

In other words, you should find a string b which is a permutation of symbols of the string a and "trygub" is not a subsequence of b.

We have a truly marvelous proof that any string can be arranged not to contain "trygub" as a subsequence, but this problem statement is too short to contain it.

Input

The first line contains a single integer t (1≤ t≤ 100) — the number of test cases.

The first line of each test case contains a single integer n (1≤ n≤ 200) — the length of a.

The next line contains the string a of length n, consisting of lowercase English letters.

Output

For each test case, output a string b of length n which is a permutation of characters of the string a, and such that "trygub" is not a subsequence of it.

If there exist multiple possible strings b, you can print any.

Example

Input


3
11
antontrygub
15
bestcoordinator
19
trywatchinggurabruh


Output


bugyrtnotna
bestcoordinator
bruhtrywatchinggura

Note

In the first test case, "bugyrtnotna" does not contain "trygub" as a subsequence. It does contain the letters of "trygub", but not in the correct order, so it is not a subsequence.

In the second test case, we did not change the order of characters because it is not needed.

In the third test case, "bruhtrywatchinggura" does contain "trygu" as a subsequence, but not "trygub".
import sys
input = sys.stdin.readline

############ ---- Input Functions ---- ############


def inp():
    return(int(input()))


def inlt():
    return(list(map(int,input().split())))


def insr():
    s = input()
    return(list(s[:len(s) - 1]))


def invr():
    return(map(int,input().split()))

# from random import shuffle
# import numpy as np


def shuffle(string_list, num):
    for i in range(0,len(string_list)-num, num):
        string_list[i], string_list[i+num-1]=string_list[i+num-1], string_list[i]
    return string_list


class Solution:
    def solve(self, string_list):


        # string= ''.join(string_list)
        # tmp='trygub'

        # i = 0
        # j = 0
        # last=len(string_list)-1
        # first=0
        # while i < len(string_list):
        #     if string_list[i] == tmp[j]:
        #         j += 1
        #         string_list[first],string_list[last]=string_list[last],string_list[first]
        #         last-=1
        #         first+=1
        #
        #     if j == len(tmp) - 1:
        #         j=0
        #     i+=1
        # num=2
        # while True:
        #     i = 0
        #     j = 0
        #     flag = False
        #     while i<len(string_list):
        #         if string_list[i]==tmp[j]:
        #             j+=1
        #
        #         if j==len(tmp)-1:
        #             flag=True
        #             break
        #         i += 1
        #
        #     if flag:
        #         string_list=shuffle(string_list,num )
        #         num+=1
        #     else:
        #         break
        #
        # t_list=[]
        # b_list=[]
        # y_list=[]
        # g_list=[]
        # r_list = []
        # u_list = []
        # for i in range(len(string_list)):
        #     if string_list[i]=='t':
        #         t_list.append(i)
        #     if string_list[i]=='b':
        #         b_list.append(i)
        #
        #     if string_list[i]=='y':
        #         y_list.append(i)
        #     if string_list[i]=='g':
        #         g_list.append(i)
        #
        #     if string_list[i]=='r':
        #         r_list.append(i)
        #     if string_list[i]=='u':
        #         u_list.append(i)
        #
        # length=min(len(t_list),len(b_list))
        #
        # for k in range(length):
        #     string_list[b_list[k]], string_list[t_list[k]]=string_list[t_list[k]], string_list[b_list[k]]
        #
        # length = min(len(y_list), len(g_list))
        #
        # for k in range(length):
        #     string_list[y_list[k]], string_list[g_list[k]]=string_list[g_list[k]], string_list[y_list[k]]
        #
        # length = min(len(r_list), len(u_list))
        #
        # for k in range(length):
        #     string_list[r_list[k]], string_list[u_list[k]] = string_list[u_list[k]], string_list[r_list[k]]

        return ''.join(sorted(string_list))


        # print(tmp)
        # stuff=list(range(len(list_)))
        # for item in itertools.combinations(stuff, len(tmp)):
        #     ans=[]
        #     for t in item:
        #         ans.append(list_[t])
        #     if list(item) != list(range(item[0], item[-1]+1)) and tmp==ans:
        #         # print(tmp,item)
        #         return "YES"
        #
        # return "NO"

n = inp()
A = Solution()
for i in range(n):
    length = inp()
    string_list = insr()
    print(A.solve(string_list))
    # string= ''.join(string)
    # for i in range(queries):
    #     k,j=invr()
    #     ans=A.solve(string, k-1,j-1)
    #     print(ans)


