Anagram Rearrangement Check

Given a string S composed entirely of characters from the set \(\{a,b,c\}\), determine whether it is possible to rearrange the characters of S to form an anagram of another string of the same length composed solely of characters from the set \(\{x,y,z\}\).

Recall that an anagram is obtained by a permutation of all the characters of a string. In this problem, you only need to verify that the input string S is valid, that is, it only contains characters \(a\), \(b\), and \(c\). If it does, output "Yes"; otherwise, output "No".

Note: Although the second string (with letters \(x, y, z\)) is mentioned, its formation is not required. The verification simply depends on whether every character of S is among \(a, b, c\).

inputFormat

The input consists of a single line containing the string S.

\(1 \leq |S| \leq 10^5\)

outputFormat

Output a single line containing either "Yes" if S contains only the characters \(a\), \(b\), and \(c\); otherwise, output "No".

aacbb

Yes