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 Go (1.6) (judge verdict: Accepted)

package main

import (
	. "fmt"
    "strings"
    "sort"
)

// func init() { Println("----------------------------------------") }

func main() {
    var s string
    Scanf("%s", &s)

    chars := strings.Split(s, "")

    sort.Sort(sort.StringSlice(chars))

    if chars[0] == "a" && chars[1] == "b" && chars[2] == "c" {
        Println("Yes")
    } else {
        Println("No")
    }
}