import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.HashMap;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc164_c solver = new abc164_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc164_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util import java.util.HashMap; HashMap java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc164_c solver = new abc164_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc164_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc164_c solver = new abc164_c();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc164_c solver = new abc164_c();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) abc164_c solver = new abc164_c(); solver new abc164_c() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class abc164_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        }

    } abc164_c public void solve(int testNumber, Scanner in, PrintWriter out) {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        } solve {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        } long N = in.nextLong(); N in.nextLong() in.nextLong in int brakecount = 0; brakecount 0 HashMap<String, Integer> S = new HashMap<String, Integer>(); S new HashMap<String, Integer>() for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            } long i = 0; long i = 0; i 0 i < N i N i++ i++ i {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            } {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            } String inS = in.next(); inS in.next() in.next in if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                } !S.containsKey(inS) S.containsKey(inS) S.containsKey S inS {
                    S.put(inS, 0);
                    brakecount++;
                } S.put(inS, 0) S.put S inS 0 brakecount++ brakecount out.println(brakecount) out.println out brakecount int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc164_c solver = new abc164_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc164_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc164_c solver = new abc164_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc164_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.HashMap;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc164_c solver = new abc164_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc164_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            long N = in.nextLong();
            //String S[] = new String[2147483647];
//          String S[] = new String[9999999];
            int brakecount = 0;
            HashMap<String, Integer> S = new HashMap<String, Integer>();
            for (long i = 0; i < N; i++) {
                String inS = in.next();
                if (!S.containsKey(inS)) {
                    S.put(inS, 0);
                    brakecount++;
                }
            }
        /*
        Arrays.sort(S);
        String oldS = "";
        for (String item :S
             ) {
            if (oldS.isEmpty()) {
                oldS = item;
            }
            if(item.compareTo(oldS)!=0){
                brakecount++;
            }
        }
        */
            out.println(brakecount);
        }

    }
}

