import sys

input = sys.stdin.readline


def main():
    N = int(input())
    S = input().rstrip()

    def match(S, P):
        assert(len(S) == len(P))
        for s, p in zip(S, P):
            if (s == p or s == '?'): continue
            return False
        return True

    patterns = ("wa", "wo", "n")

    # dp[i] := S[0,i) が wawon 文字列であるか否か
    dp = [False] * (N + 1)
    dp[0] = True
    for i in range(N):
        if not dp[i]: continue
        for p in patterns:
            n = len(p)
            if (i + n <= N and match(S[i:i + n], p)):
                dp[i + n] = True

    ans = "Yes" if dp[N] else "No"
    print(ans)


if __name__ == "__main__":
    main()