Problem:
Score : 300 points

Problem Statement

You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.

How many kinds of items did you get?

Constraints

1 \leq N \leq 2\times 10^5

S_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print the number of kinds of items you got.

Sample Input 1

3
apple
orange
apple

Sample Output 1

2

You got two kinds of items: apple and orange.

Sample Input 2

5
grape
grape
grape
grape
grape

Sample Output 2

1

Sample Input 3

4
aaaa
a
aaa
aa

Sample Output 3

4

Solution in Rust (1.42.0) (judge verdict: Accepted)

use std::collections::hash_set::HashSet;

fn main() {
    let (n, v) = read();
    let ans = solve(n, v);
    write(ans);
}

fn read() -> (i32, Vec<String>) {
    let mut l1 = String::new();
    std::io::stdin().read_line(&mut l1).ok();
    let n: i32 = l1.trim().parse().unwrap();

    let mut v: Vec<String> = Vec::new();
    for i in 0..n {
        let mut l1 = String::new();
        std::io::stdin().read_line(&mut l1).ok();
        v.push(l1.trim().to_string());
    }

    (n, v)
}

fn write(s: i32) {
    println!("{}", s);
}

fn solve<'a>(n: i32, v: Vec<String>) -> i32 {
    let hs: HashSet<String> = v.into_iter().collect();
    hs.len() as i32
}