#include<bits/stdc++.h>

using namespace std;

set<string> s;

int main()

{

    string s1;

    int n;cin>>n;

    while(n--){

        cin>>s1;s.insert(s1);

    }

    cout<<s.size()<<endl;

}

#include<bits/stdc++.h>

const int  mod=;

const int N = 1e6+;

int a[N],n,k;

using namespace std;

map<string,int>mp;

int main()

{

    string s;

    cin>>n;

    while(n--){

        cin>>s;mp[s]=;

    }

    cout<<mp.size()<<endl;

    return ;

}

#include<bits/stdc++.h>

const int  mod=;

const int N = 1e7+;

int a[N],n,k;

using namespace std;

map<string,int>mp;

int main()

{

    string s;

    cin>>n;

    int ans=,tot=;

    while(n--){

        int p = ,x=;

        cin>>s;

        for(int i = ;i < s.size();++i){

            x=x*p+s[i];

        }

        a[++tot]=x;

    }

    sort(a+,a++tot);

    cout<<unique(a+,a++tot)-a-<<endl;

    return ;

}

#include<bits/stdc++.h>

const int  mod=;

const int N = 1e5+;

int a[N],n,k;

using namespace std;

struct node{

    bool r= ;

    node *next[];

};

node root;

int ans = ;char s[];

void build_trie(){

    int l = strlen(s);

    node *p=&root;

    int flag = ;

    for(int i = ;i < l;++i){

        if(p->next[s[i]-'']==NULL){

            p->next[s[i]-''] = new node;

        }

        p=p->next[s[i]-''];

    }

    if(p->r > )flag =;

    p->r = ;

    if(flag==)return ;

    else ans++;

}

int main()

{

    int T;scanf("%d",&T);

    while(T--){

        scanf("%s",s);build_trie();

    }

    printf("%d\n",ans);

    return ;

}