{"raw_statement":[{"iden":"problem statement","content":"There is a sequence of cells that extends infinitely to both directions. You and Snuke play the following game:\n\n*   The judge chooses a string $t$ consisting of `B` and `S`, called turn string, and show it to both players.\n*   First, Snuke stands on one of the cells.\n*   Then, for each $i = 1, ..., |t|$ in this order, the following happens:\n    *   If the $i$\\-th letter of $t$ is `B`, it is your turn. You choose a cell that contains neither other blocks nor Snuke, and put a block on the cell. After that, if both of the two cells adjacent to Snuke's cell are blocked, you win and the game ends.\n    *   If the $i$\\-th letter of $t$ is `S`, it is Snuke's turn. He may move to an adjacent unblocked cell, or doesn't do anything.\n*   If the game still hasn't ended, Snuke wins and the game ends.\n\nYou are given a string $s$ consisting of `B`, `S`, and `?`. If $s$ contains $Q$ `?`s, there are $2^Q$ ways to replace each `?` with `B` or `S` and get a turn string. Among those $2^Q$ strings, how many will end up with your winning, in case both players play optimally? Find the answer modulo $998,244,353$."},{"iden":"constraints","content":"*   $1 \\leq |s| \\leq 10^6$\n*   $s$ consists of `B`, `S`, and `?`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$s$"},{"iden":"sample input 1","content":"BSSBS"},{"iden":"sample output 1","content":"0\n\nYou take the $1$st and the $4$th turn, and Snuke takes the $2$nd, the $3$rd, and the $5$th turn. In this case, if both players play optimally, it turns out that Snuke wins."},{"iden":"sample input 2","content":"?S?B????S????????B??????B??S??"},{"iden":"sample output 2","content":"16777197"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}