Ex - Hakata

AtCoder

IDabc237_h

Time2000ms

Memory256MB

Difficulty—

We have a string $S$ consisting of lowercase English letters. Bob just thinks about palindromes every day. He decided to choose some of the substrings of $S$ that are palindromes and tell them to Anna. Anna gets angry if one of the palindromes told by Bob is a substring of another. How many palindromes can Bob choose while not making Anna angry? ## Constraints * $1 \leq |S| \leq 200$ * $S$ consists of lowercase English letters. ## Input Input is given from Standard Input in the following format: $S$ [samples] ## Notes A **substring** of $S$ is the result of deleting zero or more characters from the beginning and the end of $S$. For example, `ab` is a substring of `abc`, while `ac` is not a substring of `abc`.

Samples

Input #1

ababb

Output #1

3

Three palindromes `aba`, `bab`, `bb` can be chosen.

Input #2

xyz

Output #2

3

Three palindromes `x`, `y`, `z` can be chosen.

Input #3

xxxxxxxxxx

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Ex - Hakata",
    "description": {
      "content": "We have a string $S$ consisting of lowercase English letters.   Bob just thinks about palindromes every day. He decided to choose some of the substrings of $S$ that are palindromes and tell them to An",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc237_h"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have a string $S$ consisting of lowercase English letters.  \nBob just thinks about palindromes every day. He decided to choose some of the substrings of $S$ that are palindromes and tell them to An...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments