// C++(Clang 10.0.0)

#include <iostream>
#include <stdio.h>
#include <stdlib.h> //rand() 0~RAND_MAX2147483647
#include <math.h>
#include <time.h>   //srand((unsigned int)time(NULL));
#include <unistd.h> //sleep
#include <algorithm>
#include <cmath>
#include <vector>
#include <regex> //正規表現
#include <map>
#include <unordered_map>
#include <set>
#include <cassert> //assart
#include <numeric>
#include <iterator>
#include <list>
#include <tuple>
#include <queue>

using namespace std;
#define ll long long int
#define FOR(i,min,max) for(ll i=(min);i<(max);i++)
#define FOReq(i,min,max) for(ll i=(min);i<=(max);i++)
#define FORREV(i,max,min) for(ll i=(max)-1;i>=(min);i--)
#define FORREVeq(i,max,min) for(ll i=(max);i>=(min);i--)
const int MOD=1e9+7;
const int MOD2=998244353;
const int not0=1;
const int INF=2000000001;
const ll INFll=2e18;
//const int MAX_V=10000;
const double  Micro=1e-5;

int UnUsedVariable(){
    if(INF || Micro || MOD || INFll || MOD2 || not0){;}
    return 0;
}

#define inarray(array,min,max) FOR(i,min,max){cin>>array[i];}
#define inarrayW(arrayA,arrayB,min,max) FOR(i,min,max){cin>>arrayA[i]>>arrayB[i];}
#define br printf("\n");
#define OutputAndReturn0(x) {cout<<(x)<<endl;return 0;}
#define elif else if

#define issame(a,b,c,d) ((a)==(b) and (b)==(c) and (c)==(d))
#define isdiff3(a,b,c) ((a)!=(b) and (b)!=(c) and (c)!=(a))
#define isdiff4(a,b,c,d) ((a)!=(b) and (b)!=(c) and (c)!=(a) and (d)!=(a) and (d)!=(b) and (d)!=(c))
#define isdiff5(a,b,c,d,e) ((a)!=(b) and (b)!=(c) and (c)!=(a) and (d)!=(a) and (d)!=(b) and (d)!=(c) and (e)!=(a) and (e)!=(b) and (e)!=(c) and (e)!=(d))
#define Func3(f,a,b,c) (f)((f)((a),(b)),(c))
#define Func4(f,a,b,c,d) (f)((f)((f)((a),(b)),(c)),(d))

inline int isEven(int x){return x%2==0;}
inline int isOdd (int x){return x%2==1;}
inline ll  gcd(ll a,ll b){ if(b==0)return a;else return gcd(b,a%b);}//最大公約数 なお一方が0なら答えは他方になるので番兵は０で良い また、負の数もOK -4%3=-1となるため
inline ll  lcm(ll a,ll b){return a*b/gcd(a,b);}//MODやオーバーフローには注意！
//inline ll  ceil(double a){return (ll)a+1;}
//ans = accumulate(A, A+N, 0, [](int a, int b) {return gcd(a,b);});
//auto count = std::count_if(v.begin(), v.end(), [](int x) { return x == 1 || x == 3; } );

ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};




//Eと名のつくのはデバッグ用！
int EintN(ll array[],const ll num){
    for(int i=0;i<num;i++){cerr<<array[i]<<" ";}
    br;
    return 0;
}
//int EintNN(const int heighth,const int width,int array[heighth][width]){
//    FOR(i, 0, heighth){
//        FOR(k, 0, width){
//            {cerr<<array[i][k]<<" ";}
//        }
//        br;
//    }
//    br;
//    return 0;
//}
int Eint(string str,const ll num){
    cerr<<str<<" is "<<num<<" now."<<endl;
    return 0;
}







bool IsPrime(ll num)
{
    if (num < 2) return false;
    else if (num == 2) return true;
    else if (num % 2 == 0) return false; // 偶数はあらかじめ除く
    
    double sqrtNum = sqrt(num);
    for (int i = 3; i <= sqrtNum; i += 2)
    {
        if (num % i == 0)
        {
            // 素数ではない
            return false;
        }
    }
    // 素数である
    return true;
}



ll combinum[10010][10010]={};
ll combi(ll n, ll k) {
    if (n == k || k == 0 )
        return 1;
    else if (combinum[n][k]!=0){
        return combinum[n][k];
    }else {
        return combinum[n][k]=combi(n - 1, k - 1) + combi(n - 1, k);
    }
}

long long IntPow(long long x, long long n){
    assert(n>=0);
    if(n == 0)
        return 1;
    if(n % 2 == 0)
        return IntPow(x * x, n / 2);
    else
        return x * IntPow(x, n - 1);
}









//累積和　しゃくとり法　木構造　DP キュー　乱択アルゴリズム　嘘解法　ハッシュ　next_permulation

//課題：DP 木構造　Xor

ll probA(){
    ll ans;ans=0;
    ll A,B;
    cin>>A>>B;
    if(A<=B)OutputAndReturn0("unsafe");
    OutputAndReturn0("safe")
    return 0;
}

ll probB(){
    ll ans;ans=0;
    ll HP1,AT1,HP2,AT2;
    cin>>HP1>>AT1>>HP2>>AT2;
    while(true){
        HP2 -= AT1;
        if(HP2<=0){OutputAndReturn0("Yes");}
        HP1 -= AT2;
        if(HP1<=0){OutputAndReturn0("No");}
        
    }
    return 0;
}

ll probC(){
    ll ans;ans=0;
    ll N;N=0;
    cin>>N;
    vector<string> S(N);
    FOR(i, 0, N){
        cin>>S[i];
    }
    
    sort(S.begin(), S.end());
    
     S.erase(unique(S.begin(), S.end()), S.end());
    
    OutputAndReturn0(S.size());
    return 0;
}

ll probD(){
    ll ans;ans=0;
    ll N;N=0;
    cin>>N;
    OutputAndReturn0(ans);
    return 0;
}

ll probE(){
    ll ans;ans=0;
    ll N;N=0;
    cin>>N;
    OutputAndReturn0(ans);
    return 0;
}

ll probF(){
    ll ans;ans=0;
    ll N;
    cin>>N;
    
    OutputAndReturn0(ans);
    return 0;
}

signed main(){
    cin.tie(0);    //cinとcoutの結び付き解除（cout時にcinの内容を吐き出さなくなる）
    ios::sync_with_stdio(false);  //coutとprintfの結び付き解除（coutとprintfを同時に使うな！）
    probC();
    return 0;
}








ll probD2(){
    ll ans;ans=0;
    ll H=0,W=0;
    cin>>H>>W;
    vector<string> St(H);
    FOR(i, 0, H){
        cin>>St[i];
    }
    ll Road[H][W];
    ll WhiteRoadNum=0;
    FOR(i, 0, H){
        FOR(k, 0, W){
            Road[i][k] = St[i][k]=='.' ? INF : -1; //INF is 通れる　-1 is通れない
            if(St[i][k]=='.')WhiteRoadNum++;
        }
    }
    Road[0][0]=0;
    deque<pair<ll, ll>> Que;
    Que.push_front(make_pair(0, 0));
    
    
    while (!Que.empty()) {
        auto now=Que.back();
        ll nowX=now.first,nowY=now.second;
        Que.pop_back();
        
        ll nextX,nextY;
        FOR(i, 0, 4){
            nextX=nowX+dx[i];
            nextY=nowY+dy[i];
            
            if(nextX<0 or H<=nextX)continue;
            if(nextY<0 or W<=nextY)continue;
            if(Road[nextX][nextY]!=INF)continue;
            //if(Road[nextX][nextY]==INF)...
            
            
            
            
        }
    }
    
    
    
    ll minstep=0;
    
    //もしゴール出来ないなら-1出力
    
    OutputAndReturn0(WhiteRoadNum-minstep-1);//minstep回の移動で使用するマス数は　minstep+1マス
    return 0;
}



Measured memory_bytes: 7592