#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)

int mx = 200000; // 2*(10^5) 制約のチェック用

int main()
{
    int N;
    cin >> N;
    string S;
    cin >> S;

//制約のチェック始
    assert(1<=N && N<=mx); // Nの制約
    assert((int)S.size()==N); // |S|==Nの制約
    for(int i = 0; i<N; i++)
    {
    	bool ok = false;
    	char c = S[i];
    	if('a'<=c && c<='z') ok = true;
    	if(c=='?') ok = true;
    	assert(ok); // Sの各文字が英小文字と'?'のみからなる制約
    }
//制約のチェック終

    vector<vector<bool>> dp(N+1, vector<bool>(26, false));
    dp[0]['n'-'a'] = true;
    rep(i,N) rep(j,26) if(dp[i][j])
    {
        if(j=='w'-'a')
        {
            if(S[i]=='a') dp[i+1]['a'-'a'] = true;
            if(S[i]=='o') dp[i+1]['o'-'a'] = true;
            if(S[i]=='?')
            {
                dp[i+1]['a'-'a'] = true;
                dp[i+1]['o'-'a'] = true;
            }
        }
        else
        {
            if(S[i]=='w') dp[i+1]['w'-'a'] = true;
            if(S[i]=='n') dp[i+1]['n'-'a'] = true;
            if(S[i]=='?')
            {
                dp[i+1]['w'-'a'] = true;
                dp[i+1]['n'-'a'] = true;
            }
        }
    }

    bool ans = false;
    if(dp[N]['a'-'a']) ans = true;
    if(dp[N]['o'-'a']) ans = true;
    if(dp[N]['n'-'a']) ans = true;

    if(ans) cout << "Yes" << endl;
    else cout << "No" << endl;
}