{"problem":{"name":"UFO Invasion","description":{"content":"You are given a string $S$ of length $12$. How many occurrences of `ZONe`s does it contain as contiguous substrings?","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"zone2021_a"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$ of length $12$. How many occurrences of `ZONe`s does it contain as contiguous substrings?\n\n## Constraints\n\n*   $S$ is a string of length $12$ consisting of English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"zone2021_a","tags":[],"sample_group":[["abcdZONefghi","1\n\nThe $5$\\-th through $8$\\-th characters of $S$ form a `ZONe`."],["ZONeZONeZONe","3"],["helloAtZoner","0\n\nThe $8$\\-th through $11$\\-th characters of $S$ form a `Zone`, which is not a `ZONe`."]],"created_at":"2026-03-03 11:01:13"}}