#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

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

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

bool same(char c, char d){
    if(c == '?' || d == '?') return true;
    return c == d;
}

bool ok(string s){
    assert(s.size() <= 2);
    if(s.size() == 1) return same('n', s[0]);
    if(!same('w', s[0])) return false;
    return same('a', s[1]) || same('o', s[1]);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    string s; cin >> s;
    vector<bool> dp(n+1);
    dp[0] = true;
    for(int i = 0; i < n; i++){
        if(!dp[i]) continue;
        if(ok(s.substr(i, 1))) dp[i+1] = true;
        if(i+2 <= n && ok(s.substr(i, 2))) dp[i+2] = true;
    }
    if(dp[n]) cout << "Yes "<< endl;
    else cout << "No" << endl;
}