#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;

vector < bool > viz(36005);
vector < string > v;
string a;

int N, S;

void read()
{
    ifstream f("restante.in");

    f >> N;

    for ( int i = 0; i < N; ++i )
    {
        f >> a;

        make_heap( a.begin(), a.end() );
        sort_heap( a.begin(), a.end() );

        v.push_back( a );
    }

    f.close();
}

void solve()
{
    for ( int i = 0; i < N-1; ++i )
    {
        if ( v[i] == v[i + 1] )
                viz[i] = viz[i + 1] = true;
    }

    for ( int i = 0; i < N; ++i )
            if ( viz[i] == false )
                    S++;
}

void print()
{
    ofstream g("restante.out");

    g << S << "\n";

    g.close();
}

int main()
{
    read();
    make_heap( v.begin(), v.end() );
    sort_heap( v.begin(), v.end() );
    solve();
    print();

    return 0;
}