#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;

void solve()
{
    int n;
    string s;
    cin >> n >> s;
    for (int c = 0; c < 2; c++)
    {
        for (int i = 0; i < n * 2; i++)
        {
            if (s[i % n] != '?' && s[i % n] == s[(i + 1) % n] && s[(i + 2) % n] == '?')
            {
                s[(i + 2) % n] = (s[i % n] == '0' ? '1' : '0');
            }
        }
        reverse(s.begin(), s.end());
    }
    for (int i = 0; i < n; i++)
    {
        if (s[i] != '?' && s[i] == s[(i + 1) % n] && s[i] == s[(i + 2) % n])
        {
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
}

int main()
{
    solve();
}