NYOJ 283

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
using namespace std;
/*
bool cmp(char *a,char *b)
{
     int len1 = strlen(a);
     int len2 = strlen(b);
     return len1>len2;
}
*/
int cmp(const void *a,const void *b)
{
     int len1 = strlen((char *)a);
     int len2 = strlen((char *)b);
     return len1>len2;
}
     
int main()
{
     char str[16][25];
     int i,j,k=1;
     int  num;
     while(scanf("%d",&num),num)
     {
          memset(str, 0, sizeof(str)); 
          for(i=0;i<num;i++)
               cin>>str[i];
          //sort(str,str+num,cmp);
          qsort(str,num,25,cmp);
          printf("SET %d\n",k);
          k++;
          for(i=0;i<num;i+=2)
               cout<<str[i]<<endl;
          for(j=num-1-num%2;j>0;j-=2) 
               cout<<str[j]<<endl;
     }
     //while(1);
     return 0;
}