#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
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; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int ok(string s, string t){
  if(sz(s) != sz(t)) return 0;
  rep(i,sz(s)){
    if(s[i]=='?') continue;
    if(s[i]!=t[i]) return 0;
  }
  return 1;
}

int main(){
  int N; cin >> N;
  string S; cin >> S;
  vector<int> dp(N+1,0);
  dp[0] = 1;
  rep(i,N){
    if(dp[i]==0) continue;
    if(ok(S.substr(i,1),"n")) dp[i+1] = 1;
    if(ok(S.substr(i,2),"wa")) dp[i+2] = 1;
    if(ok(S.substr(i,2),"wo")) dp[i+2] = 1;
  }
  if(dp[N]) cout << "Yes\n";
  else cout << "No\n";
  return 0;
};