{"raw_statement":[{"iden":"problem statement","content":"For a string $S$ consisting of the uppercase English letters `P` and `D`, let the _doctoral and postdoctoral quotient_ of $S$ be the total number of occurrences of `D` and `PD` in $S$ as contiguous substrings. For example, if $S =$ `PPDDP`, it contains two occurrences of `D` and one occurrence of `PD` as contiguous substrings, so the doctoral and postdoctoral quotient of $S$ is $3$.\nWe have a string $T$ consisting of `P`, `D`, and `?`.\nAmong the strings that can be obtained by replacing each `?` in $T$ with `P` or `D`, find one with the maximum possible doctoral and postdoctoral quotient."},{"iden":"constraints","content":"*   $1 \\leq |T| \\leq 2 \\times 10^5$\n*   $T$ consists of `P`, `D`, and `?`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$T$"},{"iden":"sample input 1","content":"PD?D??P"},{"iden":"sample output 1","content":"PDPDPDP\n\nThis string contains three occurrences of `D` and three occurrences of `PD` as contiguous substrings, so its doctoral and postdoctoral quotient is $6$, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each `?` in $T$ with `P` or `D`."},{"iden":"sample input 2","content":"P?P?"},{"iden":"sample output 2","content":"PDPD"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}