#include<bits/stdc++.h>
using namespace std;
#define int long long
struct node{
    bool end=0;
    int next[30];
};
vector<node>trie;
node emp;
bool find(string str){
    int nd=1;
    bool found=1;
    for(int i=0;i<str.size();i++){
        if(trie[nd].next[str[i]-'a']==-1){
            found=0;
            trie.push_back(emp);
            trie[nd].next[str[i]-'a']=trie.size()-1;
        }
        nd=trie[nd].next[str[i]-'a'];
    }
    if(!trie[nd].end) found=0,trie[nd].end=1;
    return found;
}
signed main(){
    emp.end=0;
    for(int i=0;i<30;i++) emp.next[i]=-1;
    trie.push_back(emp);
    trie.push_back(emp);
    int cnt=0;
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        string k;
        cin>>k;
        if(!find(k)) cnt++;
    }
    cout<<cnt;
    return 0;
}