#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
using namespace std;
const ll maxn = 1e6 + 7;
const ll mod = 1e9 + 7;
ll q, t, n, m, k, ans;
priority_queue<ll> pr;
string s, ss[maxn], str;
void sol()
{
    cin >> n;
    for(int i = 0; i < n; i ++)
        cin >> ss[i];
    sort(ss, ss+n);
    ans = 0;
    for(int i = 0; i < n; i ++)
    {
        ++ans;
        while(ss[i] == ss[i+1] && i + 1 < n)
            ++i;
    }
    cout << ans;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    sol();
}
