#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 1000000010;
constexpr long long INF= 2000000000000000000;

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 1;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 998244353;

int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<bool> dp(n + 1);
    dp[0] = true;
    for(int i = 0;i < n;i++) {
        if(s[i] == 'n' || s[i] == '?') dp[i + 1] = (dp[i + 1] | dp[i]);
        if(i != n - 1 && (s[i] == 'w' || s[i] == '?')) {
            if(s[i + 1] == 'o' || s[i + 1] == 'a' || s[i + 1] == '?') dp[i + 2] = (dp[i + 2] | dp[i]);
        }
    }
    if(dp[n]) cout << "Yes" << endl;
    else cout << "No" << endl;
}