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 (GCC 5.4.1) (judge verdict: Accepted)

// abc of ABC
#include <stdio.h>

int main(void){
    char s[3+1];
    scanf("%s", s);

    int abcnum[3] = {};
    int able = 1;
    for(int i = 0; s[i] != '\0'; i++){
        if(s[i] == 'a') abcnum[0]++;
        else if(s[i] == 'b') abcnum[1]++;
        else abcnum[2]++;

        if(abcnum[0] > 1 || abcnum[1] > 1 || abcnum[2] > 1){
            able = 0;
            break;
        }
    }

    printf("%s\n", (able)? "Yes" : "No");
    return 0;
}