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: Wrong Answer)

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);
    let mut ans: bool = false;
    if fst == "a".chars().nth(0) || fst == "b".chars().nth(0) || fst == "c".chars().nth(0) {
        if snd != fst && (snd == "a".chars().nth(0) || snd == "b".chars().nth(0) || snd == "c".chars().nth(0)) {
            if trd != fst && trd != fst && (trd == "a".chars().nth(0) || trd == "b".chars().nth(0) || trd == "c".chars().nth(0)) {
                ans = true;
            }
        }
    }
    
    if ans{
        println!("Yes", );
    }else{
        println!("No", );
    }
}