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;

namespace AtCoder.ABC093
{
    public class A
    {
        public static void Solve()
        {
            string[] input = Console.ReadLine().Split(' ');
            string s1 = input[0];

            int a = 0;
            int b = 0;
            int c = 0;
            for (int i = 0; i < s1.Length; i++)
            {
                if (s1[i].ToString() == "a")
                {
                    a++;
                }
                if (s1[i].ToString() == "b")
                {
                    b++;
                }
                if (s1[i].ToString() == "c")
                {
                    c++;
                }
            }
        
            Console.WriteLine(a == 1 && b ==1 && c == 1 ? "Yes": "No");
        }    
    }
}

namespace AtCoder {
    class Program
    {
        static void Main(string[] args)
        {
            ABC093.A.Solve();
        }
    }
}