Problem: Overlooking the captivating blend of myriads of vernal hues, Arkady the painter lays out a long, long canvas.

Arkady has a sufficiently large amount of paint of three colours: cyan, magenta, and yellow. On the one-dimensional canvas split into n consecutive segments, each segment needs to be painted in one of the colours.

Arkady has already painted some (possibly none or all) segments and passes the paintbrush to you. You are to determine whether there are at least two ways of colouring all the unpainted segments so that no two adjacent segments are of the same colour. Two ways are considered different if and only if a segment is painted in different colours in them.

Input

The first line contains a single positive integer n (1 ≤ n ≤ 100) — the length of the canvas.

The second line contains a string s of n characters, the i-th of which is either 'C' (denoting a segment painted in cyan), 'M' (denoting one painted in magenta), 'Y' (one painted in yellow), or '?' (an unpainted one).

Output

If there are at least two different ways of painting, output "Yes"; otherwise output "No" (both without quotes).

You can print each character in any case (upper or lower).

Examples

Input

5
CY??Y


Output

Yes


Input

5
C?C?Y


Output

Yes


Input

5
?CYC?


Output

Yes


Input

5
C??MM


Output

No


Input

3
MMY


Output

No

Note

For the first example, there are exactly two different ways of colouring: CYCMY and CYMCY.

For the second example, there are also exactly two different ways of colouring: CMCMY and CYCMY.

For the third example, there are four ways of colouring: MCYCM, MCYCY, YCYCM, and YCYCY.

For the fourth example, no matter how the unpainted segments are coloured, the existing magenta segments will prevent the painting from satisfying the requirements. The similar is true for the fifth example.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
  int n;
  cin >> n;
  getchar();
  cin >> s;
  int sum = 0, flag = 0, flag1 = 0, flag2 = 1;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == s[i + 1] && s[i] != '?' && s[i + 1] != '?') {
      flag2 = 0;
      break;
    } else {
      if (s[i] == '?') {
        sum++;
        if (s[i - 1] == '?' || s[i + 1] == '?')
          flag = 1;
        else if (s[i - 1] == s[i + 1])
          flag1 = 1;
      }
    }
  }
  if (n == 1 && s[0] == '?') {
    puts("Yes");
    return 0;
  }
  if (!flag2 || sum == 0 || n == 1)
    puts("No");
  else {
    if (sum == 1) {
      if (s[0] == '?' || s[s.size() - 1] == '?')
        puts("Yes");
      else {
        if (!flag1)
          puts("No");
        else
          puts("Yes");
      }
    } else {
      if (flag) {
        puts("Yes");
      } else if (s[0] == '?' || s[s.size() - 1] == '?')
        puts("Yes");
      else {
        if (!flag1)
          puts("No");
        else
          puts("Yes");
      }
    }
  }
  return 0;
}