{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ of length $12$. How many occurrences of `ZONe`s does it contain as contiguous substrings?"},{"iden":"constraints","content":"*   $S$ is a string of length $12$ consisting of English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"abcdZONefghi"},{"iden":"sample output 1","content":"1\n\nThe $5$\\-th through $8$\\-th characters of $S$ form a `ZONe`."},{"iden":"sample input 2","content":"ZONeZONeZONe"},{"iden":"sample output 2","content":"3"},{"iden":"sample input 3","content":"helloAtZoner"},{"iden":"sample output 3","content":"0\n\nThe $8$\\-th through $11$\\-th characters of $S$ form a `Zone`, which is not a `ZONe`."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}