You are given a string S, consisting of only lowercase Latin letters and the string is encoded. Each letters has numerical equivalent corresponding to it's position in the Alphabetical order, i.e 'a' corresponds to 1, 'b' corresponds to 2 and so on till 'i' which corresponds to 9.

You have to tell, when the string is decoded into a number by replacing the characters with numbers, if it is divisible by 6.

Input:
The first line contains a string consisting of only Lowercase Latin letters ( 'a'-'i' ).

Output:
Print "YES" (without the quotes) if the decoded number is divisible by 6, "NO" (without the quotes) otherwise.

Constraints:
String will not contain more than 10⁵ characters
1 ≤ |S| ≤ 10⁵