Problem:
Score : 200 points

Problem Statement

In Japan, people make offerings called hina arare, colorful crackers, on March 3.

We have a bag that contains N hina arare. (From here, we call them arare.)

It is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.

We have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.

If the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.

Constraints

1 \leq N \leq 100

S_i is P, W, G or Y.

There always exist i, j and k such that S_i=P, S_j=W and S_k=G.

Input

Input is given from Standard Input in the following format:

N
S_1 S_2 ... S_N

Output

If the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.

Sample Input 1

6
G W Y P Y W

Sample Output 1

Four

The bag contained arare in four colors, so you should print Four.

Sample Input 2

9
G W W G P W P G G

Sample Output 2

Three

The bag contained arare in three colors, so you should print Three.

Sample Input 3

8
P Y W G Y W Y Y

Sample Output 3

Four

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

// use std::collections::HashMap;

fn solve() -> i32 {
    let _ = read();
    let s = read_line_str();
    // let mut hmap: HashMap<char, i32> = HashMap::new();

    for i in s.replace("\n", "").replace(" ", "").chars() {
        if i == 'Y' {
            println!("Four");
            return 0;
        }
    }
    println!("Three");
    return 0;
}

fn main() {
    solve();
    // let _ = read();
    // let s = read_line_str();
    // let mut hmap: HashMap<char, i32> = HashMap::new();

    // for i in s.replace("\n", "").replace(" ", "").chars() {
    //     let mut n: i32 = 0;
    //     match hmap.get(&i) {
    //         Some(k) => n = *k,
    //         None => (),
    //     }
    //     hmap.insert(i, n + 1);
    // }

    // // for (k, v) in hmap.drain() {
    // //     println!("{}:{}", k, v);
    // // }

    // if hmap.keys().len() == 3 {
    //     println!("Three");
    // } else {
    //     println!("Four");
    // }
}

fn read() -> i32 {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

// fn read_line() -> (i32, i32) {
//     let mut s = String::new();
//     std::io::stdin().read_line(&mut s).ok();
//     let v : Vec<i32> = s.trim()
//         .split_whitespace()
//         .map(|e| e.parse().ok().unwrap())
//         .collect();
//     return (v[0], v[1]);
// }

fn read_line_str() -> String {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    return s;
}