import java.util.*;
import java.io.*;
import java.math.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    //配列の定義.
    String a[] = new String[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.next();
    }
    Arrays.sort(a);
    int ans = n;
    for(int i = 0; i < n - 1; i++) {
      //文字列の比較
      //a[i] == a[i + 1]でなく .equals を使う.
      if(a[i].equals(a[i + 1])) ans--;
    }
    System.out.println(ans);
  }
}


/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