pub mod scanner {
    pub struct Scanner {
        buf: Vec<String>,
    }

    impl Scanner  {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }

        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }

        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }

        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}

use crate::scanner::Scanner;
use std::collections::*;

fn main() {
    let mut scanner = Scanner::new();
    let t = 1;
    for _ in 0..t {
        solve(&mut scanner);
    }
}

fn solve(scanner: &mut Scanner) {
    let n: usize = scanner.next();
    let t: String = scanner.next();
    let mut s: Vec<(usize, char)> = t.char_indices().collect::<Vec<(usize, char)>>();
    let mut flag = true;
    for i in 0..n {
        if s[i].1 == '?' {
            if i > 0 {
                if s[i-1].1 == 'w' {
                    s[i].1 = 'a';
                    continue;
                }
            }
            if i < n-1 {
                if s[i+1].1 == 'a' || s[i+1].1 == 'o' {
                    s[i].1 = 'w';
                    continue;
                }
            }
            s[i].1 = 'n';
        }
    }
    if s[0].1 != 'w' && s[0].1 != 'n' {
        flag = false;
    }
    for i in 1..n {
        if s[i-1].1 == 'w' {
            if s[i].1 != 'a' && s[i].1 != 'o' {
                flag = false;
            }
        } else if s[i-1].1 == 'a' || s[i-1].1 == 'o' || s[i-1].1 == 'n' {
            if s[i].1 != 'w' && s[i].1 != 'n' {
                flag = false;
            }
        } else {
            flag = false;
        }
    }
    if s[n-1].1 != 'a' && s[n-1].1 != 'o' && s[n-1].1 != 'n' {
        flag = false;
    }
    if flag {
        println!("Yes");
    } else {
        println!("No");
    }
}