#include <bits/stdc++.h>

using namespace std;

const int N = 1000;
int arr[N];

int main()
{
    int n;
    while(cin >> n)
    {
        string trainee;
        for(int i = 0; i < n; i++)
        {
            cin >> trainee;
            arr[i] = 0;
            for(int j = 0; j < trainee.size(); j++)
            {
                //if(trainee[i]-'0' > 0 && trainee[i]-'0' <= 9) {
                    arr[i] |= (1 << (trainee[j]-'0'));
                //    cout << trainee[i]  <<" read " << trainee[i] << endl;
                //    cout << "new arr " << arr[i] << endl;
  //          }
            }
        }

    //    for(int i = 0; i < n; i++)
      //      cout << arr[i] << endl;

        sort(arr, arr + n , [] (int a, int b) {
            return a < b;
        });



        int totalUnique = 0;
        bool change = false;
        int previos = 0;
        for(int i = 0; i < n; i++)
        {
            if (previos == arr[i]) {
                previos = arr[i];
            } else {
                previos = arr[i];
                ++totalUnique;
            }
           // cout << arr[i] << endl;
            //if(arr[i] != arr[i -1])
             //   totalUnique++;
        }

       // cout << "result" << endl;
        cout << totalUnique << endl;
    }
    return 0;
}