UFO Invasion

AtCoder

IDzone2021_a

Time2000ms

Memory256MB

Difficulty—

You are given a string $S$ of length $12$. How many occurrences of `ZONe`s does it contain as contiguous substrings? ## Constraints * $S$ is a string of length $12$ consisting of English letters. ## Input Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

abcdZONefghi

Output #1

1

The $5$\-th through $8$\-th characters of $S$ form a `ZONe`.

Input #2

ZONeZONeZONe

Output #2

Input #3

helloAtZoner

Output #3

0

The $8$\-th through $11$\-th characters of $S$ form a `Zone`, which is not a `ZONe`.

API Response (JSON)

{
  "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...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments