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

int N,NR;

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

struct cmp
{
    bool operator()(const char*a, const char *b)const
    {
        if (strcmp (a,b) < 0) return 1;
        return 0;
    }
};

char *x[36001];

inline int comp(char A[], char B[])
{
    int k;
    if (strlen(A)>strlen(B)) k=strlen(A);
    else k=strlen(B);
    for (int i = 1; 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++)
    {
        x[i] = new char[17];
        fgets(x[i],17,f);
        sort(x[i],x[i]+strlen(x[i])-1);
    }
}
inline void verf()
{
    int i,q,w;
    sort (x+1, x+N+1, cmp());
    for (i=1;i<=N;i++)
    {
        if (i!=1) q=comp(x[i-1],x[i]);
        else q=-1;
        if (i!=N) w=comp(x[i+1],x[i]);
        else w=-1;
        if (q && w) NR++;
    }
}
int main()
{
    fscanf(f,"%d\n",&N);
    cit();
    verf();
    fprintf(g,"%d\n",NR);
    return 0;
}