PROGRAMMING:Symmetric sort

You work for the albatross circus with a bunch of ugly stars as its pillars. You've just finished a program that outputs a list of stars in non descending order according to the length of their name string (that is, the length of the current name is at least the same as that of the previous name). However, your boss doesn't like this kind of output format. He suggests that the length of the first and last names of the output is shorter, while the length of the middle part is slightly longer, which shows symmetry. The boss said that the specific method is to deal with the list which has been arranged according to the length one by one, putting the former in the first part of the current sequence and the latter in the tail. For example, for the first case in the input example, Bo and pat are the first pair of names, Jean and Kevin are the second pair, and so on.
###Input format:
The input contains several test cases. The first line of each case contains an integer n (n > = 1), indicating the number of name strings. Next, each line has a name string, which is arranged by length. The name string does not contain spaces, and each string contains at least one character. N = 0 is the sign of the end of input.
###Output format:
For each test case, first output a line of "set n", where n starts from 1, indicating the case serial number. Then there are n lines of name output, as shown in the output example.
###Input example:
```in
seven
Bo
Pat
Jean
Kevin
Claude
William
Marybeth
six
Jim
Ben
Zoe
Joey
Frederick
Annabelle
five
John
Bill
Fran
Stan
Cece
0
```
###Output example:
```out
SET 1
Bo
Jean
Claude
Marybeth
William
Kevin
Pat
SET 2
Jim
Zoe
Frederick
Annabelle
Joey
Ben
SET 3
John
Fran
Cece
Stan
Bill
```







answer：If there is no answer, please comment