/* 
 * File:   baloon.cpp
 * Author: cteam022
 *
 * Created on October 22, 2016, 9:21 AM
 */

#include <cstdlib>
#include <iostream>
#include <string>
#include <algorithm>
#include <unordered_set>

using namespace std;


#define FOR(i,n) for(int i=0;i<n;i++)
#define FOR1(i,n) for(int i=1;i<=n;i++)

/*
 * 
 */
 bool cisla[10];  
string ss; 
    
    
int preved(string s){
    int cislo=0;
    sort(s.begin(),s.end());
    auto last = std::unique(s.begin(), s.end());
    // v now holds {1 2 3 4 5 6 7 x x x x x x}, where 'x' is indeterminate
    s.erase(last, s.end()); 
    FOR(i,s.size()){
        cislo=cislo*10+s[i]-'0';
            
    }
    
    //cout<<cislo<<endl;
    return cislo;
}    
    
int main() {

    string s;
    int pocet;
    int a,n;
    unordered_set<int> hash;
    
    while(cin>>n){
        pocet=0;
        hash.clear();
        FOR(i,n){
            
            
            cin>>s;
            a=preved(s);
            if(hash.find(a)==hash.end()){
                pocet++;
                hash.insert(a);
            }
            
            
        }
        cout<<pocet<<'\n';
    }
    return 0;
}