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);

	}
} import java.util.Scanner; Scanner java.util import java.util.TreeMap; TreeMap java.util 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);

	}
} 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);

	} main {

		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);

	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int total = 0; total 0 TreeMap<String, Integer> s = new TreeMap<>(); s new TreeMap<>() for (int i = 0; i < n; i++) {
			String input = sc.next();
			if (s.containsKey(input)) {

			} else {
				s.put(input, 1);
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			String input = sc.next();
			if (s.containsKey(input)) {

			} else {
				s.put(input, 1);
			}
		} {
			String input = sc.next();
			if (s.containsKey(input)) {

			} else {
				s.put(input, 1);
			}
		} String input = sc.next(); input sc.next() sc.next sc if (s.containsKey(input)) {

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

			} {
				s.put(input, 1);
			} s.put(input, 1) s.put s input 1 for (String key : s.keySet()) {
			total++;
		} String key s.keySet() s.keySet s {
			total++;
		} {
			total++;
		} total++ total System.out.println(total) System.out.println System.out System System.out total String[] args args 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);

	}
} 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);

	}
} Main
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);

	}
}
