A. Broken Keyboard

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently Polycarp noticed that some of the buttons of his keyboard are malfunctioning. For simplicity, we assume that Polycarp's keyboard contains 2626 buttons (one for each letter of the Latin alphabet). Each button is either working fine or malfunctioning.

To check which buttons need replacement, Polycarp pressed some buttons in sequence, and a string ss appeared on the screen. When Polycarp presses a button with character cc, one of the following events happened:

• if the button was working correctly, a character cc appeared at the end of the string Polycarp was typing;
• if the button was malfunctioning, two characters cc appeared at the end of the string.

For example, suppose the buttons corresponding to characters a and c are working correctly, and the button corresponding to b is malfunctioning. If Polycarp presses the buttons in the order a, b, a, c, a, b, a, then the string he is typing changes as follows: a →→ abb →→ abba →→ abbac →→ abbaca →→ abbacabb →→ abbacabba.

You are given a string ss which appeared on the screen after Polycarp pressed some buttons. Help Polycarp to determine which buttons are working correctly for sure (that is, this string could not appear on the screen if any of these buttons was malfunctioning).

You may assume that the buttons don't start malfunctioning when Polycarp types the string: each button either works correctly throughout the whole process, or malfunctions throughout the whole process.

Input

The first line contains one integer tt (1≤t≤1001≤t≤100) — the number of test cases in the input.

Then the test cases follow. Each test case is represented by one line containing a string ss consisting of no less than 11 and no more than 500500 lowercase Latin letters.

Output

For each test case, print one line containing a string resres. The string resres should contain all characters which correspond to buttons that work correctly in alphabetical order, without any separators or repetitions. If all buttons may malfunction, resres should be empty.

Example

input

Copy

4
a
zzaaz
ccff
cbddbb

output

Copy

a
z

bc

解题说明：水题，只需要判断字母没有连续出现2次就证明字母按键是正确的

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include<iostream>
#include<algorithm>
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int i, t, n, j;
	scanf("%d", &t);
	char s1[1000];
	for (j = 0; j < t; j++)
	{
		scanf("%s", &s1);
		n = strlen(s1);
		int count[500] = { 0 };
		for (i = 0; i < n; i++)
		{
			if (s1[i] == s1[i + 1])
			{
				i++;
			}
			else
			{
				count[s1[i]]++;
			}
		}
		for (i = 'a'; i <= 'z'; i++)
		{
			if (count[i] > 0)
			{
				printf("%c", i);
			}
		}
		printf("\n");

	}
}