#include <fstream>
#include <algorithm>
#define ll long long
using namespace std;
ifstream in("restante.in");
ofstream out("restante.out");
struct record
{
    ll a[20],k,rez;
}A[36009];
bool cmp ( record a, record b )
{
    return a.rez<b.rez;
}
int main()
{
    ll n; in>>n;
    string s;
    for(ll j=1; j<=n; j++)
    {
        in>>s;
        A[j].k=s.size();
        for(ll i=0; i<A[j].k; i++)
          A[j].a[i+1]=s[i]-'a'+1;
          sort(A[j].a+1, A[j].a + A[j].k+1);
        A[j].rez=0;
        for(ll i=1; i<=A[j].k; i++)
        {
             A[j].rez += A[j].a[i];
             A[j].rez *=26;
        }
        A[j].rez /= 26 ;

    }
    sort( A+1,A+n+1,cmp);
    A[0].rez=-1; A[n+1].rez = -1;
    ll sol = 0 ;
    for(ll i=1; i<=n; i++)
    {
       if( A[i-1].rez != A[i].rez && A[i+1].rez !=A[i].rez  ) sol ++;
    }
    out<<sol;
    return 0;
}