#include <fstream>
#include <algorithm>
using namespace std;

int N,NR;
char x[36001][17];

FILE *f=fopen("restante.in","r");
FILE *g=fopen("restante.out","w");

inline int comp(char A[], char B[])
{
    int k=strlen(A);
    for (int i = 0; i < k; ++i)
        if (A[i] < B[i]) return -1;
        else if (A[i] > B[i]) return 1;
    return 0;
}
inline void cit()
{
    for (int i=1;i<=N;i++)
    {
        fgets(x[i],16,f);
        sort(x[i],x[i]+strlen(x[i]));
    }
}
inline void verf()
{
    int i,j;
    bool stop;
    for (i=1;i<=N;i++)
    {
        stop=0;
        for (j=1;j<=N && !stop;j++)
            if (!comp(x[i],x[j]) && !(i==j)) stop=1;
        if (!stop) NR++;
    }
}
int main()
{
    fscanf(f,"%d\n",&N);
    cit();
    verf();
    fprintf(g,"%d\n",NR);
    return 0;
}