import sys #sys.setrecursionlimit(10 ** 6) INF = float('inf') MOD = 10**9 + 7 MOD2 = 998244353 from collections import defaultdict def ceil(A,B): return -(-A//B) def solve(): def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LC(): return list(sys.stdin.readline().rstrip()) def IC(): return [int(c) for c in sys.stdin.readline().rstrip()] def MI(): return map(int, sys.stdin.readline().split()) N = II() S = LC() D = [0]*N for i in range(N): if(S[i]=="w"): D[i]=0 elif(S[i]=="a" or S[i]=="o"): D[i]=1 elif(S[i]=="n"): D[i]=2 elif(S[i]=="?"): D[i]=-1 else: print("No") exit() DP = [[0]*3 for _ in range(N+1)] if(S[0]=="?"): for i in range(3): DP[0][i]=1 elif(S[0]=="w"): DP[0][0]=1 elif(S[0]=="n"): DP[0][2]=1 #print(DP[0]) for i in range(1,N): if(D[i]==-1): DP[i][0] = DP[i-1][1] | DP[i-1][2] DP[i][1] = DP[i-1][0] DP[i][2] = DP[i-1][1] | DP[i-1][2] elif(D[i]==0 or D[i]==2): #print(DP[i-1][1],DP[i-1][2],DP[i-1][1] | DP[i-1][2]) DP[i][D[i]] = DP[i-1][1] | DP[i-1][2] elif(D[i]==1): DP[i][D[i]] = DP[i - 1][0] #print(D[i],DP[i]) if(DP[N-1][0] or DP[N-1][1] or DP[N-1][2]): print("Yes") else: print("No") return solve()