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;
use std::io;
fn main() {
    let mut l1 = String::new();
    let stdin = io::stdin();
    stdin.read_line(&mut l1).unwrap();
    let trimed = l1.trim_end();
    let mut itr = trimed.split_ascii_whitespace();
    let a = itr.next().unwrap().parse::<usize>().unwrap();
    let mut map = HashMap::<String, i32>::new();
    for _x in 0..a {
        let mut l2 = String::new();
        stdin.read_line(&mut l2).unwrap();
        let trimed = l2.trim_end();
        let mut itr = trimed.split_ascii_whitespace();
        let a = itr.next().unwrap();
        map.insert(a.to_string(), 1);
    }
    println!("{}", map.len());
}