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: Wrong Answer)

#include<cstdio>
#include<algorithm>
using namespace std;
int ans;
int main() {
	int a[4];
	scanf("%d%d%d",&a[1],&a[2],&a[3]);
	while(a[1]!=a[2]||a[2]!=a[3]||a[1]!=a[3]) {
		sort(a+1,a+4);
		ans++;
		if(a[2]-a[1]>=2) {
			a[1]+=2;
		}
		else {
			a[1]++;
			a[2]++;
		}
		
	}
	printf("%d",ans);
	return 0;
}