Taco Permutation Checker

Given a string T, determine whether it is a permutation of the string "1234". A string is considered a valid permutation if and only if:

• The length of T is exactly 4.
• Each character in "1234" appears exactly once in T.

In mathematical terms, let \( |T| \) denote the length of T. Then T is a valid permutation of "1234" if and only if \(|T|=4\) and for every digit \(d \in \{1,2,3,4\}\), the count of \(d\) in T is exactly one.

You need to read the input from stdin and write the result to stdout. If T is a valid permutation, output "Yes"; otherwise, output "No".

inputFormat

The input consists of a single string T read from standard input. The string may contain any characters.

outputFormat

Output a single line: "Yes" if T is a permutation of "1234", otherwise "No".

1234

Yes