wwwvvvvvv

AtCoder

IDabc279_a

Time2000ms

Memory256MB

Difficulty—

You are given a string $S$ consisting of `v` and `w`. Print the number of "bottoms" in the string $S$ (see the figure at Sample Input/Output). ## Constraints * $S$ is a string consisting of `v` and `w`. * The length of $S$ is between $1$ and $100$, inclusive. ## Input The input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

vvwvw

Output #1

7

![image](https://img.atcoder.jp/abc279/53a8734c956ed9751e1d02505ba8655c.png)
The image above shows the seven "bottoms" in the string `vvwvw`.

Input #2

Output #2

Input #3

wwwvvvvvv

Output #3

API Response (JSON)

{
  "problem": {
    "name": "wwwvvvvvv",
    "description": {
      "content": "You are given a string $S$ consisting of `v` and `w`. Print the number of \"bottoms\" in the string $S$ (see the figure at Sample Input/Output).",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc279_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a string $S$ consisting of `v` and `w`.\nPrint the number of \"bottoms\" in the string $S$ (see the figure at Sample Input/Output).\n\n## Constraints\n\n*   $S$ is a string consisting of `v` an...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments