Problem:
Score : 100 points

Problem Statement

You are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.

Constraints

|S|=3

S consists of a, b and c.

Input

Input is given from Standard Input in the following format:

S

Output

If S can be obtained by permuting abc, print Yes; otherwise, print No.

Sample Input 1

bac

Sample Output 1

Yes

Swapping the first and second characters in bac results in abc.

Sample Input 2

bab

Sample Output 2

No

Sample Input 3

abc

Sample Output 3

Yes

Sample Input 4

aaa

Sample Output 4

No

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

fn main() {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).ok();
    let vec: Vec<&str> = buf.split_whitespace().collect();
    let fst = vec[0].chars().nth(0);
    let snd = vec[0].chars().nth(1);
    let trd = vec[0].chars().nth(2);

    if snd != fst && trd != fst && trd != snd {
        println!("Yes", );
    }else{
        println!("No", );
    }
    //
    // let mut contain_a: bool = false;
    // let mut contain_b: bool = false;
    // let mut contain_c: bool = false;
    //
    // if fst == "a".chars().nth(0){
    //     contain_a = true;
    // }else if fst == "b".chars().nth(0){
    //     contain_b = true;
    // }else if fst == "c".chars().nth(0){
    //     contain_c = true;
    // }
    //
    // if snd == "a".chars().nth(0){
    //     contain_a = true;
    // }else if snd == "b".chars().nth(0){
    //     contain_b = true;
    // }else if snd == "c".chars().nth(0){
    //     contain_c = true;
    // }
    //
    // if trd == "a".chars().nth(0){
    //     contain_a = true;
    // }else if trd == "b".chars().nth(0){
    //     contain_b = true;
    // }else if trd == "c".chars().nth(0){
    //     contain_c = true;
    // }
    //
    // if contain_a && contain_b && contain_c{
    //     println!("Yes", );
    // }else{
    //     println!("No", );
    // }

}