#include <fstream>
#include <algorithm>
#include <unordered_map>

using namespace std;

ifstream in("restante.in");
ofstream out("restante.out");
int n, ans;
string s;
unordered_map<string, int> um;

int main()
{
    in>>n;

    for(int i = 1; i<=n; i++)
    {
        in>>s;

        sort(s.begin(), s.end());

        um[s]++;
    }

    for(auto it: um)
    {
        if(it.second == 1)
        {
            ans++;
        }
    }

    out<<ans;

    return 0;
}