{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ consisting of lowercase English letters. Print the number of non-empty strings $T$ that satisfy the following condition, modulo $998244353$.\n\n> The concatenation $TT$ of two copies of $T$ is a subsequence of $S$ (not necessarily contiguous)."},{"iden":"constraints","content":"*   $S$ is a string consisting of lowercase English letters whose length is between $1$ and $100$, inclusive."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"ababbaba"},{"iden":"sample output 1","content":"8\n\nThe eight strings satisfying the condition are `a`, `aa`, `ab`, `aba`, `b`, `ba`, `bab`, and `bb`."},{"iden":"sample input 2","content":"zzz"},{"iden":"sample output 2","content":"1\n\nThe only string satisfying the condition is `z`. Note that this string contributes to the answer just once, although there are three ways to extract the subsequence `zz` from $S = S_1S_2S_3 = $ `zzz`: $S_1S_2 = $ `zz`, $S_1S_3 = $ `zz`, and $S_2S_3 = $ `zz`."},{"iden":"sample input 3","content":"ppppqqppqqqpqpqppqpqqqqpppqppq"},{"iden":"sample output 3","content":"580"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}