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 OCaml (4.02.3) (judge verdict: Accepted)

let () =
    let s = read_line () |> Str.split (Str.regexp "") in
    let ans = List.fold_left (fun (a, b, c) elt ->
            match elt with
            | "a" -> (a + 1, b, c)
            | "b" -> (a, b + 1, c)
            |  _  -> (a, b, c + 1)
        ) (0, 0, 0) s
    in
    if ans = (1, 1, 1) then print_endline "Yes"
    else print_endline "No"