After improving the marketing strategy, TIANKENG has made a fortune and he is going to step into the status of TuHao. Nevertheless, TIANKENG wants his restaurant to go international, so he decides to name his restaurant in English. For the lack of English skills, TIANKENG turns to CC, an English expert, to help him think of a property name. CC is a algorithm lover other than English, so he gives a long string S to TIANKENG. The string S only contains eight kinds of letters-------¡®A¡¯, ¡®B¡¯, ¡®C¡¯, ¡®D¡¯, ¡®E¡¯, ¡®F¡¯, ¡®G¡¯, ¡®H¡¯. TIANKENG wants his restaurant¡¯s name to be out of ordinary, so the restaurant¡¯s name is a string T which should satisfy the following conditions: The string T should be as short as possible, if there are more than one strings which have the same shortest length, you should choose the string which has the minimum lexicographic order. Could you help TIANKENG get the name as soon as possible?
Meanwhile, T is different from all the substrings of S. Could you help TIANKENG get the name as soon as possible?
Input
The first line input file contains an integer T(T<=50) indicating the number of case.
In each test case:
Input a string S. the length of S is not large than 1000000.
Output
For each test case:
Output the string t satisfying the condition.(T also only contains eight kinds of letters-------¡®A¡¯, ¡®B¡¯, ¡®C¡¯, ¡®D¡¯, ¡®E¡¯, ¡®F¡¯, ¡®G¡¯, ¡®H¡¯.)
