count = 1 def doThis(): global count; for i in (1,2,3): count += 1 doThis() print(count)

There is a sequence of words in CamelCase as a string of letters,s , having the following properties:

1.It is a concatenation of one or more words consisting of English letters.

2.All letters in the first word are lowercase.

3.For each of the subsequent words, the first letter is uppercase and rest of the letters are lowercase.

Given s, determine the number of words in s.

Example

s = oneTwoThree
There are 3 words in the string 'one', 'Two', 'Three'

Sample Input

saveChangesInTheEditor

Sample Output

5

Explanation

String s contains five words
save
Changes
In
The
Editor

Bear Limak has a string S. Each character of S is a digit '0' or '1'.

Help Limak and check if all the '1' digits form a single non-empty segment (consecutive subsequence) in the string. For each test case, print "YES" or "NO" accordingly.

Input

Bear Limak has a string S. Each character of S is a digit '0' or '1'. Help Limak and check if all the '1' digits form a single non-empty segment (consecutive subsequence) in the string. For each test case, print "YES" or "NO" accordingly.

Output

For each test case, output a single line containing the answer — "YES" if all the '1' digits form a single non-empty segment, and "NO" otherwise. Don't print the quotes