#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

// input
template<class T>
istream &operator>>(istream &is, vector<T> &v){
    for(T &in : v) is >> in;
    return is;
}
template<class T, class S>
istream &operator>>(istream &is, pair<T, S> &p){
    is >> p.first >> p.second;
    return is;
}
template<class... T> void input(T&... a) {(cin >> ... >> a);}

//output
template<class T>
ostream & operator<<(ostream &os, const vector<T> &v){
    for(int i = 0; i < (int)v.size(); i++) os << (i == 0 ? "" : " ") << v[i];
    return os;
}
template<class T, class S>
ostream &operator<<(ostream &os, const pair<T, S> &p){
    os << p.first << " " << p.second;
    return os;
}
template<class T, class S>
ostream &operator<<(ostream &os, const map<T, S> &mp){
    for(auto &[key, val] : mp) os << key << ":" << val << " ";
    return os;
}
template<class T>
ostream &operator<<(ostream &os, const set<T> &st){
    for(auto itr = st.begin(); itr != st.end(); itr++) os << (itr == st.begin() ? "" : " ") << *itr;
    return os;
}
template<class T>
ostream &operator<<(ostream &os, const multiset<T> &st){
    for(auto itr = st.begin(); itr != st.end(); itr++) os << (itr == st.begin() ? "" : " ") << *itr;
    return os;
}
template<class T>
ostream &operator<<(ostream &os, queue<T> que){
    while(!que.empty()) {
        os << que.front(); que.pop();
        if(!que.empty()) os << " ";
    }
    return os;
}
template<class T>
ostream &operator<<(ostream &os, stack<T> st){
    while(!st.empty()) {
        os << st.top(); st.pop();
        if(!st.empty()) os << " ";
    }
    return os;
}
template <class T, class Container, class Compare>
ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq)
{
    while (!pq.empty()){
        os << pq.top(); pq.pop();
        if(!pq.empty()) os << " ";
    }
    return os;
}
void print() {cout << "\n";}
template<class T> void print(const T& a) {cout << a << '\n';}
template<class T, class... Ts> void print(const T& a, const Ts&... b) {cout << a; (..., (cout  << ' ' << b)); cout << '\n';}

#define debug(var) cout << #var << " = ";print(var);

typedef long long lint;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _overload3(_1,_2,_3,name,...) name
#define _rrep(i,n) rrepi(i,n,0)
#define rrepi(i,a,b) for(int i=int(a-1);i>=int(b);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main() {
    int N; string S; input(N, S);

    stack<char> st;
    rep(i, N){
        if(st.empty()){
            if(S[i] == 'w' || S[i] == '?') st.push(S[i]);
            else if(S[i] == 'n') continue;
            else {print("No"); return 0;}
        }
        else{
            if(st.top() == 'w'){
                if(S[i] == 'a' || S[i] == 'o' || S[i] == '?') st.pop();
                else {print("No"); return 0;}
            }
            else{
                if(S[i] == 'a' || S[i] == 'o' || S[i] == 'n') st.pop();
                else {st.pop(); st.push(S[i]);}
            }
        }
    }
    print("Yes");
}