#include <bits/stdc++.h>
using namespace std;

ifstream ci("restante.in");
ofstream cou("restante.out");

string s;
string p[36005];
int n;

void rez(){
    ci>>n;
    int i,cn=0;
    for(i=1;i<=n;i++){
        ci>>s;
        sort(s.begin(),s.end());
        p[i]=s;
    }
    sort(p+1,p+n+1);
    if(p[1]!=p[2]){
        cn++;
    }
    if(p[n]!=p[n-1]){
        cn++;
    }
    for(i=2;i<=n-1;i++){
        if(p[i]!=p[i-1]&&p[i]!=p[i+1]){
            cn++;
        }
    }
    cou<<cn;

}

int main()
{
    rez();
    return 0;
}