#include <algorithm>
#include <bit>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>
#include <string>

using namespace::std;

template<typename T, typename U>
ostream& operator<< (ostream& o, const pair<T, U>& p) {
  o << "<" << p.first << ", " << p.second << ">";
  return o;
}

template <typename T>
ostream& operator<< (ostream& o, const vector<T>& v) {
 for (const auto& x : v) o << x << " ";
 return o;
}

ostream& operator<<(ostream& o, const unordered_map<long long, long long>& m) {
  o << "{";
  for (const auto& [k, v] : m)
    o << " " << k << ": " << v << ",";
  o << "}";
  return o;
}

template <typename T>
istream& operator>> (istream& i, vector<T>& v) {
  for (auto& x : v) i >> x;
  return i;
}

int main() {
  ios::sync_with_stdio(false);
  int n;
  string s;
  cin >> n >> s;
  unordered_set<char> p {'n'};
  for (char c : s) {
    unordered_set<char> q;
    if (p.count('a') || p.count('o') || p.count('n')) {
      q.insert('w');
      q.insert('n');
    }
    if (p.count('w')) {
      q.insert('a');
      q.insert('o');
    }
    if (q.empty() || (c != '?' && !q.count(c))) {
      cout << "No" << endl;
      return 0;
    }
    p.clear();
    if (c == '?') p = q;
    else p.insert(c);
  }
    
  cout << "Yes" << endl;
  return 0;
}