Problem: Dark completed with studying Strings last night and trying to solve the problem of primes numbers from last three months but did not succeed every time he preferred to ask your help and same goes this time.

He likes to play a game with PRIMES AND STRINGS and he named the game as "PRIME ASCII CHARACTERS".

The rules are  as simple as finding the primes.

He wants you to read a string and delete all the characters whose ASCII VALUES is found to be a prime number.

Input:

The first line contains T, the number of test cases.
Followed by T lines each contains a single string 'S'.

Output:

For every test case print the string by removing the PRIME ASCII CHARACTERS.

print "NULL" If all the characters of a string are prime ascii characters.

Constraints:

1 ≤ T ≤ 10000
1 ≤ |S| ≤ 100000

Author : Darshak Mehta

Note: String contains only Alphabets both UPPER & LOWER CASES.

SAMPLE INPUT
4
MEHTA
Mehta
HELLO
hello

SAMPLE OUTPUT
MEHTA
Mht
HELL
hllo

Solution (in PYTHON):

Solution:
def sqrt(n):
  """ Efficient sqrt Algorithm """
  x = n
  y = (x + n / x) / 2
  while y < x:
    x = y
    y = (x + n / x) / 2
  return x
def isPrime(num):
    """ Primality Test Algorithm """
    if num<=1:
        return 0
    if num==2:
        return 1
    if num%2 == 0:
        return 0
    sRoot = sqrt(num*1.0)
    i=3
    while(i<=sRoot):
        if(num%i==0):
            return 0
	i+=2
    return 1
def removePrimeASCII(s):
	mstr=""
	diff = 0
	for i in s:
		ip = isPrime(ord(i))
		if ip == 1:
			continue;
		else:
			mstr+=i
	if len(mstr) == 0:
		print "NULL"
	else:
		print mstr
t=input()
for i in range(0,t,1):
	s=raw_input()
	removePrimeASCII(s)