Pablo is trying to escape from the police master plan which Agent Murphy is trying to execute. While observing some things, he found that the police has a secret code for this plan. Pablo needs to obtain that code!

Pablo got an array of numbers A of length N

There can be many permutations (P₁,P₂....P_m) of that array.

For each permutation P_i, its code (an integer) is generated by concatenation of all the non-prime numbers in that permutation. Now, there will be many codes, as one code is generated for each permutation. But among those, there exists a secret code.

After some studying on the pattern, Gustavo finds out that the secret code is actually the largest one among all the codes!

Note :- There can be multiple occurrences of the secret code.

Can you help Pablo find the secret code?

INPUT

• First line contains an integer T, the number of Test Cases.
• Each test case consists of two lines.
• The first line of each test case contains N, the number of integers in the array A. The second line of each test case contains space separated integers A₁,A₂..A_N.

OUTPUT

• Output should contain exactly T lines. Each line containing the secret code for that array. If no number inside the array is non-prime, print No Secret Code!

CONSTRAINTS

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 10³
• 0 ≤ A_i ≤ 10⁵

DISTRIBUTION

• 1 ≤ T ≤ 10 follows for each file.
• 1 ≤ N ≤ 5
  0 ≤ A_i ≤ 100 - 10 Points
• 1 ≤ N ≤ 100
  0 ≤ A_i ≤ 10³ - 50 Points
• 1 ≤ N ≤ 10³
  0 ≤ A_i ≤ 10⁵ - 100 Points