#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define Rep(i,a,n)for(int i=(int)(a);i<(int)(n);i++)
#define rep(i,n)Rep(i,0,n)
typedef long long ll;
typedef long double ld;
#define M(x,y) ((x)>(y)?(x):(y))
#define m(x,y) ((x)<(y)?(x):(y))

int main() {
	int n, ans=0, count[200010];
	char s[200010][11];
	scanf("%d\n", &n);
	rep(i, n) scanf("%s", &s[i]);
	qsort(s, n, 11, strcmp);
	count[0] = 1;
	Rep(i,1,n) {
		if (strcmp(s[i - 1], s[i]) == 0) {
			count[i] = count[i - 1] + 1;
		}
		else {
			count[i] = 1;
		}
	}
	rep(i, n) { if (count[i] == 1)ans++; }
	printf("%d", ans);
}