#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
int i,aux,n,b,k,j,p,m,s,so[36001];
char a[36001][20];

int cmp(int x,int y)
{
    if(strcmp(a[x],a[y])>0)
    return 1;
    return 0;
}

int main()
{
    freopen ("restante.in","r",stdin);
    freopen ("restante.out","w",stdout);

    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        so[i]=i;
        scanf("%s\n",&a[i]);
        sort(a[i],a[i]+strlen(a[i]));
       // printf("%s\n",a[i]);
    }
    sort(so+1,so+n+1,cmp);
    int cont=0;

    for(i=1;i<=n;i++)
    {
        printf("%s\n",a[i]);
        if(strcmp(a[so[i]],a[so[i-1]])!=0)
        if(strcmp(a[so[i]],a[so[i+1]])!=0)
            cont++;
    }
   //  printf("%d\n",cont);


}