#pragma region Macros #include #include #if defined(LOCAL) || defined(_DEBUG) #include "debug.hpp" #else #define O(...) #define START() #define STOP() #define MEMORY() #endif using namespace std; #define REP(i, n) for(int i=0, i##_len=(n); i=0; --i) #define FOR(i, n, m) for(int i=(m), i##_len=(n); ibool chmax(T &a, const U &b) { if (a<(T)b) { a=(T)b; return 1; } return 0; } templatebool chmin(T &a, const U &b) { if (b<(T)a) { a=(T)b; return 1; } return 0; } #define vec vector #define umap unordered_map #define uset unordered_set using ll = long long; using ld = long double; using P = pair; using Tup = tuple; using vl = vec; #define fi first #define se second #define el endl constexpr ll INF = numeric_limits::max()/2-1; template istream &operator>>(istream &stream, vec& o){REP(i, o.size())stream >> o[i];return stream;} #define I(T, ...) ;T __VA_ARGS__;__i(__VA_ARGS__); void __i() {} template void __i(T&& o, Ts&&... args){cin >> o;__i(forward(args)...);} #pragma endregion void Main(); int main(){ std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(15); Main(); MEMORY(); return 0; } int dp[(int)2e5+10][2]; bool rec(string s, ll i, bool isw) { if(s.size() == i) { return isw == false; } int &res = dp[i][isw]; if(~res) return res; res = 0; if(isw && s[i] != 'w' && s[i] != '?') { return false; } switch(s[i]) { case '?': res |= rec(s, i+1, false); if(!isw) res |= rec(s, i+1, true); break; case 'a': case 'o': res |= rec(s, i+1, true); break; case 'w': if(!isw) return false; case 'n': res |= rec(s, i+1, false); break; default: return false; } return res; } void Main(){ memset(dp, -1, sizeof(dp)); I(ll, n); I(string, s); reverse(ALL(s)); cout << (rec(s, 0, false) ? "Yes" : "No") << el; }