Problem:
Score : 200 points

Problem Statement

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.

We have a string T consisting of P, D, and ?.

Among 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.

Constraints

1 \leq |T| \leq 2 \times 10^5

T consists of P, D, and ?.

Input

Input is given from Standard Input in the following format:

T

Output

Print one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.
If there are multiple such strings, you may print any of them.

Sample Input 1

PD?D??P

Sample Output 1

PDPDPDP

This 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.

Sample Input 2

P?P?

Sample Output 2

PDPD

Solution in Ruby (2.7.1) (judge verdict: Time Limit Exceeded)

### SNIPPET
  # n = gets.split.map(&:to_i)
  # array = n.times.map { gets.split.map(&:to_i) }
  # [].all?(&:even?)
  # a = [*1..m].repeated_combination(n).to_a
  # [1,2,3,4,5].select { |num| num.even? }  # => [2, 4]
  # ["a","a","b"].group_by(&:itself).map{|k,v| [k, v.count]}.to_h #=> {"a"=>2, "b"=>1}
  # 切り捨て: .floor(2).to_f ,切り上げ： .ceil(2).to_f,四捨五入: round(2)
  # 3.upto(6) do |i|, 6.downto(3) do |i|
  # 公約数125.gcd(100)、公倍数125.lcm(100)
  # PI = Math::PI
  # 高さ = a * Math.sin(w / 180.0 * Math::PI), 底辺 = a * Math.cos(w / 180.0 * Math::PI)
  def chmax(a, b) a > b ? a : b end
  INF = Float::INFINITY
  # def chmin(a, b) a < b ? a : b end

t = gets.chomp
n = t.length

dp = []
(n).times {dp << [0, ""]}

if t[-1] == 'D'
  dp[-1] = [1,'D']
elsif t[-1] == 'P'
  dp[-1] = [0,'P']
elsif t[-1] == '?'
  dp[-1] = [1,'D']
end

(n-1-1).downto(0) do |i|
  if t[i] == "D"
    dp[i][0] = dp[i+1][0] + 1
    dp[i][1] = "D" + dp[i+1][1]
  elsif t[i] == "?"
    if dp[i+1][1][0] == "D"
      dp[i][0] = dp[i+1][0] + 1
      dp[i][1] = "P" + dp[i+1][1] 
    else
      dp[i][0] = dp[i+1][0] + 1
      dp[i][1] = "D" + dp[i+1][1]
    end
  elsif t[i] == "P"
    if dp[i+1][1][0] == "D"
      dp[i][0] = dp[i+1][0] + 1
    end
    dp[i][1] = "P" + dp[i+1][1]
  end
end

puts dp[0][1]