import java.util.Scanner;
import java.util.TreeMap;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int total = 0;

		TreeMap<String, Integer> s = new TreeMap<>();

		for (int i = 0; i < n; i++) {
			String input = sc.next();
			if (s.containsKey(input)) {

			} else {
				s.put(input, 1);
			}
		}

		for (String key : s.keySet()) {
			total++;
		}

		System.out.println(total);

	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz