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

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn=1e6+10;
int main()
{
    string s;
    cin>>s;
    int a[100]={0};
    for(int i=0;i<3;i++){
        a[s[i]-'a']++;
    }
    if(a[0]==1 && a[1]==1 && a[2]==1) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}