#include <bits/stdc++.h>

using namespace std;

#define ULL unsigned long long

const ULL Mod = 212370440130137957ll;

char c[];

int pri = ;

ULL number[];

inline ULL Hash1(char s[]) {

    int Len = strlen(s);

    ULL base = , ret = ;

    for(int i = ; i < Len; i ++) ret = (ret * base + s[i]) % Mod + pri;

    return ret;

}

inline ULL Hash2(char s[]) {

    int Len = strlen(s);

    ULL base = , ret = ;

    for(int i = ; i < Len; i ++) ret = (ret * base + (ULL)s[i]) % Mod + pri;

    return ret;

}

inline ULL Hash3(char s[]) {

    int Len = strlen(s);

    ULL base = , ret = ;

    for(int i = ; i < Len; i ++) ret = (ret * base + s[i]) % Mod + pri;

    return ret;

}

int main() {

    int n;

    cin >> n;

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

        scanf("%s", c);

        ULL Num = (((Hash1(c) * ) % Mod * Hash2(c) *  % Mod) * Hash3(c)) % Mod;

        number[i] = Num;

    }

    sort(number + , number + n + );

    int tot = ;

    for(int i = ; i < n; i ++) if(number[i] != number[i + ]) tot ++;

    cout << tot;

    return ;

}