import std;

void main () {
    int N = readln.chomp.to!int;
    string S = readln.chomp;
    solve(N, S);
}

void solve (int N, string S) {
    string[] candidate = ["wa", "wo", "n"];
    while (true) {
        // base case
        if (S.length == 0) {
            break;
        }
        if (S[0] == '?' && S.length == 1) {
            S = [];
            break;
        }
        if (S[0] == '?' && S[1] == '?') {
            S = S[1..$];
            continue;
        }

        // search("n"は最後の手段)
        bool match;
        foreach (cc; candidate) {
            match = true;
            foreach (i; 0..cc.length) {
                if (S[i] != '?' && S[i] != cc[i]) {
                    match = false;
                    break;
                }
            }
            if (match) {
                S = S[cc.length..$];
                break;
            }
        }

        if (!match) {
            break;
        }
    }

    if (S.length == 0) {
        writeln("Yes");
    } else {
        writeln("No");
    }
}