Problem: 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.

Examples

Input

PD?D??P


Output

PDPDPDP


Input

P?P?


Output

PDPD

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		
		Scanner scan = new Scanner(System.in);
		
		String s = scan.next();
		String[] s1 = s.split("");
		String[] s2 = new String[s1.length];
		int ans = 0;
		
		for(int i = 0; i < s1.length; i++) {
			
			/*if(s1[i].equals("?")) {
				if(i == s1.length -1) {
					s1[i] = "D";
				}
				
				if(s1[i+1].equals("D") && i < s1.length -2) {
					s1[i] = "P";
				}
				if(s1[i-1].equals("P") && i > 1) {
					s1[i] = "D";
				}
				
				
			}*/
			if(s1[i].equals("?")) {
				s2[i] = "D";
				
			}
			else {
				s2[i] = s1[i];
				
			}
			
		}
		
		for(int i = 0; i < s1.length; i++) {
			
			if(s1[i].equals("D")) {
				ans++;
			}
			if(i < s1.length - 1) {
			if(s1[i].equals("P") && s1[i+1].equals("D")) {
				ans++;
			}
			}
		}
		String answer = String.join("", s2);
		
		System.out.println(answer);
		
	}

}