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::HashMap;

fn main() {
    let (n, v) = input();
    println!("{}", solve(n, v));
}

fn input() -> (usize, Vec<String>) {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.pop();
    let n: usize = buf.parse().unwrap();
    let mut v: Vec<String> = Vec::new();
    for i in 0..n {
        let mut b = String::new();
        std::io::stdin().read_line(&mut b).unwrap();
        b.pop();
        v.push(b);
    }
    (n, v)
}

fn solve(n: usize, v: Vec<String>) -> usize {
    let mut set: HashMap<String, bool> = HashMap::new();
    for a in v.iter() {
        set.entry(a.to_string()).or_insert(true);
    }
    set.len()
}