#include <iostream>
#include <vector> 
#include <string>
#include <algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<string> str(n);
	for(int i = 0; i < n; i++) cin >> str[i]; 
    //排序让相同的字符串相邻
	sort(str.begin(),str.end());
    //遍历求个数
	int count = 1, i = 0, j = 1;
	for(j; j < n; j++)
		if(str[i] != str[j]) {
			i = j;
			count++;
		}
	cout << count;
	return 0;	
}