#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct node {
	struct node *left;
	struct node *right;
	char word[11];
};

struct node *
insert(struct node *p, char *word)
{
	int cmp;
	if (p == NULL) {
		p = (struct node *)malloc(sizeof(struct node));
		p->left = (struct node *)NULL;
		p->right = (struct node *)NULL;
		strcpy(p->word, word);
		return p;
	} else {
		cmp = strcmp( word, p->word);
		if ( cmp == 0) {
			/* already exist */
			return p;
		} else if (cmp < 0) {
			p->left = insert(p->left, word);
			return p;
		} else if (cmp > 0) {
			p->right = insert(p->right, word);
			return p;
		} else {
			printf("This case is not exist");
		}
	}
}

int countNode(struct node *p, int n)
{
	n++;
	if (p->left != NULL)
		n =	countNode(p->left, n);
	if (p->right != NULL)
		n = countNode(p->right, n);
	return n;
}

int main()
{
	int i, n, ret;
	int N;
	char **S;
	char **Depot;
	int hit;
	struct node *root = (struct node *)NULL;
	
	ret = scanf("%d", &N);
	
	S = (char **) malloc(sizeof(char *)*N);
	for (i = 0;i < N; i++) {
		S[i] = (char *) malloc(sizeof(char)*11);
	}

	for (i = 0; i < N; i++){
		ret = scanf("%s\n", S[i]);
		root = insert(root, S[i]);
	}
	n = countNode(root, 0);
	printf("%d\n",n);
	fflush(stdout);
	free(S);
	return EXIT_SUCCESS;
}
