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: Time Limit Exceeded)

use std::io::{self, Write};

fn main() {
    let mut stdout = io::stdout();
    let stdin = io::stdin();

    let mut input = String::new();
    stdin.read_line(&mut input).expect("failed to read line");
    let n: i32 = input.trim().parse().expect("failed to parse");

    let mut lottery: Vec<String> = Vec::new();
    for _ in 0..n {
        let mut draw = String::new();
        stdin.read_line(&mut draw).expect("failed to read line");
        if lottery.contains(&draw) {
            continue;
        } else {
            lottery.push(draw);
        }
    }
    println!("{}", lottery.len());
    stdout.flush().unwrap();
}