import java.util.*;
     
class Main{
    public static void main(String[] args) {
        
        try(Scanner sc = new Scanner(System.in)){
            int n = Integer.parseInt(sc.next());
            Map<String, Integer> mapG = new HashMap<String, Integer>();

            for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            }

            System.out.println(mapG.size());

        }catch(Exception e){
            e.printStackTrace();
        }        
    }
} import java.util.*; util.* java class Main{
    public static void main(String[] args) {
        
        try(Scanner sc = new Scanner(System.in)){
            int n = Integer.parseInt(sc.next());
            Map<String, Integer> mapG = new HashMap<String, Integer>();

            for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            }

            System.out.println(mapG.size());

        }catch(Exception e){
            e.printStackTrace();
        }        
    }
} Main public static void main(String[] args) {
        
        try(Scanner sc = new Scanner(System.in)){
            int n = Integer.parseInt(sc.next());
            Map<String, Integer> mapG = new HashMap<String, Integer>();

            for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            }

            System.out.println(mapG.size());

        }catch(Exception e){
            e.printStackTrace();
        }        
    } main {
        
        try(Scanner sc = new Scanner(System.in)){
            int n = Integer.parseInt(sc.next());
            Map<String, Integer> mapG = new HashMap<String, Integer>();

            for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            }

            System.out.println(mapG.size());

        }catch(Exception e){
            e.printStackTrace();
        }        
    } try(Scanner sc = new Scanner(System.in)){
            int n = Integer.parseInt(sc.next());
            Map<String, Integer> mapG = new HashMap<String, Integer>();

            for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            }

            System.out.println(mapG.size());

        }catch(Exception e){
            e.printStackTrace();
        } catch(Exception e){
            e.printStackTrace();
        } Exception e {
            e.printStackTrace();
        } e.printStackTrace() e.printStackTrace e {
            int n = Integer.parseInt(sc.next());
            Map<String, Integer> mapG = new HashMap<String, Integer>();

            for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            }

            System.out.println(mapG.size());

        } Scanner sc = new Scanner(System.in) Scanner sc = new Scanner(System.in) new Scanner(System.in) int n = Integer.parseInt(sc.next()); n Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc Map<String, Integer> mapG = new HashMap<String, Integer>(); mapG new HashMap<String, Integer>() for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            } {
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            } String keihin = sc.next(); keihin sc.next() sc.next sc if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                } mapG.containsKey(keihin) mapG.containsKey mapG keihin {
                    mapG.put(keihin, mapG.get(keihin) + 1);
                } mapG.put(keihin, mapG.get(keihin) + 1) mapG.put mapG keihin mapG.get(keihin) + 1 mapG.get(keihin) mapG.get mapG keihin 1 {
                    mapG.put(keihin, 1);
                } mapG.put(keihin, 1) mapG.put mapG keihin 1 System.out.println(mapG.size()) System.out.println System.out System System.out mapG.size() mapG.size mapG String[] args args
import java.util.*;
     
class Main{
    public static void main(String[] args) {
        
        try(Scanner sc = new Scanner(System.in)){
            int n = Integer.parseInt(sc.next());
            Map<String, Integer> mapG = new HashMap<String, Integer>();

            for(int i = 0; i < n; i++){
                String keihin = sc.next();
                if(mapG.containsKey(keihin)){
                    mapG.put(keihin, mapG.get(keihin) + 1);
                }else{
                    mapG.put(keihin, 1);
                }
            }

            System.out.println(mapG.size());

        }catch(Exception e){
            e.printStackTrace();
        }        
    }
}