小米考试（电话号码）

import java.io.BufferedInputStream;
import java.util.Arrays;
import java.util.Scanner;

public class T2 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(new BufferedInputStream(System.in));
		int t = scanner.nextInt();
		scanner.nextLine();
		for (int i = 0; i < t; i++) {
			String aString = scanner.nextLine();
			int[] tmp1 = diff(aString);
			Arrays.sort(tmp1);
			int len = tmp1.length;
			System.out.print(tmp1[0]);
			for (int j = 1; j < len; j++) {
				System.out.print(tmp1[j]);
			}
			System.out.println();
		}
	}

	public static int[] diff(String a) {
		int[] all = new int[30];
		int count = 0;
		int len = a.length();
		int[] ans = new int[len];
		char[] achar = a.toCharArray();
		for (int i = 0; i < len; i++) {
			all[achar[i] - 'A']++;
		}
		for (int i = 0; i < len; i++) {
			if (achar[i] == 'Z') {
				ans[count++] = 0;
				all['Z' - 'A']--;
				all['E' - 'A']--;
				all['R' - 'A']--;
				all['O' - 'A']--;
			}
			if (achar[i] == 'W') {
				ans[count++] = 2;
				all['W' - 'A']--;
				all['T' - 'A']--;
				all['O' - 'A']--;
			}
			if (achar[i] == 'G') {
				ans[count++] = 8;
				all['E' - 'A']--;
				all['I' - 'A']--;
				all['G' - 'A']--;
				all['H' - 'A']--;
				all['T' - 'A']--;
			}
			if (achar[i] == 'U') {
				ans[count++] = 4;
				all['F' - 'A']--;
				all['O' - 'A']--;
				all['U' - 'A']--;
				all['R' - 'A']--;
			}
			if (achar[i] == 'X') {
				ans[count++] = 6;
				all['S' - 'A']--;
				all['I' - 'A']--;
				all['X' - 'A']--;
			}
		}
		String tmp3 = "";
		for (int i = 0; i < 30; i++) {
			if (all[i] != 0) {
				for (int j = 0; j < all[i]; j++) {
					tmp3 += (char) (i + 'A');
				}
			}
		}
		achar = tmp3.toCharArray();
		len = achar.length;
		for (int i = 0; i < len; i++) {
			if (achar[i] == 'H') {
				ans[count++] = 3;
				all['T' - 'A']--;
				all['H' - 'A']--;
				all['R' - 'A']--;
				all['E' - 'A']--;
				all['E' - 'A']--;
			}
			if (achar[i] == 'O') {
				ans[count++] = 1;
				all['N' - 'A']--;
				all['E' - 'A']--;
				all['O' - 'A']--;
			}
			if (achar[i] == 'S') {
				ans[count++] = 7;
				all['S' - 'A']--;
				all['E' - 'A']--;
				all['N' - 'A']--;
				all['V' - 'A']--;
				all['E' - 'A']--;
			}
		}
		for (int i = 0; i < 30; i++) {
			if (all[i] > 0) {
				for (int j = 0; j < all[i]; j++) {
					ans[count++] = 5;
				}
				break;
			}
		}
		int[] res = new int[count];
		for (int i = 0; i < count; i++) {
			res[i] = ans[i];
		}
		return res;
	}
}