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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;

class test {
    static void Main() {
        string s = Console.ReadLine();
        bool a = false;
        bool b = false;
        bool c = false;
        for (int i = 0; i < 3; i++) {
            switch (s[i]) {
                case 'a':
                    a = true;
                    break;
                case 'b':
                    b = true;
                    break;
                case 'c':
                    c = true;
                    break;
            }
        }
        if (a && b && c)Console.WriteLine("Yes");
        else Console.WriteLine("No");
    }
}