Zoos
Basic programming
Input/output
87.0% success
208,836 attempts
0.5s time
256MB memory
1024KB max code
You are required to enter a word that consists of \(x\) and \(y\) that denote the number of Zs and Os respectively. The input word is considered similar to word zoo if \(2\times x=y\).
Determine if the entered word is similar to word zoo.
For example, words such as zzoooo and zzzoooooo are similar to word zoo but not the words such as zzooo and zzzooooo.
Input format
- First line: A word that starts with several Zs and continues by several Os.
Note: The maximum length of this word must be \(20\).
Output format
Print Yes if the input word can be considered as the string zoo otherwise, print No.
Examples
Input
zzzoooooo
Output
Yes
Explanation
-
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Loading Editor...