#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

const int N=2005,mod=998244353;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;}

int n;
string s;
bool dp[N];

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cout << fixed << setprecision(20);
    cin >> n >> s;
    dp[0]=1;
    for(int i=0; i<n; ++i){
        if(s[i]=='?'||s[i]=='n') dp[i+1]|=dp[i];
        if(i>0){
            if((s[i-1]=='?'||s[i-1]=='w')&&(s[i]=='?'||s[i]=='a'||s[i]=='o')) dp[i+1]|=dp[i-1];
        }
    }
    cout << (dp[n]?"Yes":"No") << "\n";
}