Acacius is studying strings theory. Today he came with the following problem.

You are given a string $s$ of length $n$ consisting of lowercase English letters and question marks. It is possible to replace question marks with lowercase English letters in such a way that a string "abacaba" occurs as a substring in a resulting string exactly once?

Each question mark should be replaced with exactly one lowercase English letter. For example, string "a?b?c" can be transformed into strings "aabbc" and "azbzc", but can't be transformed into strings "aabc", "a?bbc" and "babbc".

Occurrence of a string $t$ of length $m$ in the string $s$ of length $n$ as a substring is a index $i$ ($1 \leq i \leq n - m + 1$) such that string $s[i..i+m-1]$ consisting of $m$ consecutive symbols of $s$ starting from $i$-th equals to string $t$. For example string "ababa" has two occurrences of a string "aba" as a substring with $i = 1$ and $i = 3$, but there are no occurrences of a string "aba" in the string "acba" as a substring.

Please help Acacius to check if it is possible to replace all question marks with lowercase English letters in such a way that a string "abacaba" occurs as a substring in a resulting string exactly once.


-----Input-----

First line of input contains an integer $T$ ($1 \leq T \leq 5000$), number of test cases. $T$ pairs of lines with test case descriptions follow.

The first line of a test case description contains a single integer $n$ ($7 \leq n \leq 50$), length of a string $s$.

The second line of a test case description contains string $s$ of length $n$ consisting of lowercase English letters and question marks.


-----Output-----

For each test case output an answer for it.

In case if there is no way to replace question marks in string $s$ with a lowercase English letters in such a way that there is exactly one occurrence of a string "abacaba" in the resulting string as a substring output "No".

Otherwise output "Yes" and in the next line output a resulting string consisting of $n$ lowercase English letters. If there are multiple possible strings, output any.

You may print every letter in "Yes" and "No" in any case you want (so, for example, the strings yEs, yes, Yes, and YES will all be recognized as positive answer).


-----Example-----
Input
6
7
abacaba
7
???????
11
aba?abacaba
11
abacaba?aba
15
asdf???f???qwer
11
abacabacaba

Output
Yes
abacaba
Yes
abacaba
Yes
abadabacaba
Yes
abacabadaba
No
No



-----Note-----

In first example there is exactly one occurrence of a string "abacaba" in the string "abacaba" as a substring.

In second example seven question marks can be replaced with any seven lowercase English letters and with "abacaba" in particular.

In sixth example there are two occurrences of a string "abacaba" as a substring.

Difficulty: interview

Starter code:

Solutions:
import sys
INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br


"""
Facts and Data representation
Constructive? Top bottom up down
"""
def check(s):
  t = 'abacaba'
  ans = 0
  for i in range(len(s)):
    if s[i: i + 7] == t:
      ans += 1
  return ans

def solve():
  n, = I()
  s = input()
  t = 'abacaba'
  cnt = check(s)
  if cnt > 1:
    print('No')
    return
  elif cnt == 1:
    s = list(s)
    for i in range(n):
      if s[i] == '?':
        s[i] = 'z'
    print('Yes')
    print(''.join(s))
  else:
    s = list(s)
    ok = s[::]
    for i in range(n - 6):
      ok = s[::]
      for j in range(7):
        if s[i + j] == t[j]:
          continue
        elif s[i + j] == '?':
          ok[i + j] = t[j]
        else:
          break
      else:
        for i in range(n):
          if ok[i] == '?':
            ok[i] = 'z'
        ok = ''.join(ok)
        if check(ok) != 1:
          continue
        print('Yes')
        print(ok)
        return
    print('No')

t, = I()
while t:
  t -= 1
  solve()

import sys
t = int(input())
req = 'abacaba'

for _ in range(t):
    n = int(sys.stdin.readline())
    s = sys.stdin.readline().rstrip()

    cnt = 0
    for i in range(n-6):
        if s[i:i+7] == req:
            cnt += 1

    if cnt == 1:
        print('Yes')
        print(s.replace('?', 'z'))
        continue
    if cnt > 1:
        print('No')
        continue

    for i in range(n-6):
        if all(c1 == c2 or c1 == '?' for c1, c2 in zip(s[i:i+7], req)):
            if s[i+7:i+11] == 'caba' or i >= 4 and s[i-4:i] == 'abac':
                continue
            s = s[:i] + req + s[i+7:]
            print('Yes')
            print(s.replace('?', 'z'))
            break
    else:
        print('No')


#
#    ------------------------------------------------
#           ____          _     Generatered using
#          / ___|        | |
#         | |    __ _  __| | ___ _ __  ______ _
#         | |   / _` |/ _` |/ _ \ '_ \|_  / _` |
#         | |__| (_| | (_| |  __/ | | |/ / (_| |
#          \____\____|\____|\___|_| |_/___\____|
#
#      GNU Affero General Public License v3.0
#    ------------------------------------------------
#    Author   : prophet
#    Created  : 2020-07-19 05:12:32.701664
#    UUID     : fZpWYlRPKqbpTDmt
#    ------------------------------------------------
#
production = True

import sys, math, collections

def input(input_format = 0, multi = 0):

    if multi > 0: return [input(input_format) for i in range(multi)]
    else:
        next_line = sys.stdin.readline()[:-1]

        if input_format >= 10:
            use_list = False
            input_format = int(str(input_format)[-1])
        else: use_list = True

        if input_format == 0: formatted_input = [next_line]
        elif input_format == 1: formatted_input = list(map(int, next_line.split()))
        elif input_format == 2: formatted_input = list(map(float, next_line.split()))
        elif input_format == 3: formatted_input = list(next_line)
        elif input_format == 4: formatted_input = list(map(int, list(next_line)))
        elif input_format == 5: formatted_input = next_line.split()
        else: formatted_input = [next_line]

        return formatted_input if use_list else formatted_input[0]

def out(output_line, output_format = 0, newline = True):

    formatted_output = ""

    if output_format == 0: formatted_output = str(output_line)
    elif output_format == 1: formatted_output = " ".join(map(str, output_line))
    elif output_format == 2: formatted_output = "\n".join(map(str, output_line))

    print(formatted_output, end = "\n" if newline else "")

def log(*args):
    if not production:
        print("$$$", end = "")
        print(*args)

enu = enumerate

ter = lambda a, b, c: b if a else c

ceil = lambda a, b: -(-a // b)

def mapl(iterable, format = 0):
    
    if format == 0: return list(map(int, iterable))
    elif format == 1: return list(map(str, iterable))
    elif format == 2: return list(map(list, iterable))
#
#   >>>>>>>>>>>>>>> START OF SOLUTION <<<<<<<<<<<<<<
#

def ch(a, r, n):
    
    c = 0

    for i in range(n - 6):
        y = a[i:i + 7]
        if y == r:
            c += 1

    return c == 1

def solve():

    n = input(11)
    a = input(3)

    r = list("abacaba")

    for i in range(n - 6):
        y = a[i:i + 7]
        for x, z in zip(y, r):
            if not (x == "?" or x == z):
                break
        else:
            s = a[:i] + r + a[i + 7:]
            if ch(s, r, n):
                u = ""
                for j in s:
                    if j == "?":
                        u += "z"
                    else:
                        u += j
                out("Yes")
                out(u)
                return

    out("No")
    return


for i in range(input(11)): solve()
# solve()

#
#   >>>>>>>>>>>>>>>> END OF SOLUTION <<<<<<<<<<<<<<<
#


def f(s):
  t="abacaba"
  for i in range(7):
    if s[i]!="?" and t[i]!=s[i]:return False
  return True
def g(s):
  c=0
  for i in range(7,len(s)+1):
    if s[i-7:i]=="abacaba":c+=1
  return c

for _ in range(int(input())):
  n=int(input())
  s=input()
  if g(s)>1:
    print("No")
    continue
  if "abacaba" in s:
    print("Yes")
    print(s.replace("?","z"))
    continue
  flag=False
  for i in range(7,len(s)+1):
    if f(s[i-7:i]):
      t=(s[:i-7]+"abacaba"+s[i:]).replace("?","z")
      if g(t)>1:continue
      print("Yes")
      print(t)
      flag=True
      break
  if not(flag):print("No")

check="abacaba"

def compare(s,t):
    res=True
    for i in range(len(s)):
        res&=(s[i]==t[i] or s[i]=="?" or t[i]=="?")
    return res


for _ in range(int(input())):
    n=int(input())
    s=input()
    ans="No"
    res=""
    for i in range(n-6):
        t=s
        test=t[i:i+7]
        if compare(test,check):
            t=s[:i]+check+s[i+7:]
            t=t.replace("?","z")
            count=0
            for j in range(n-6):
                if t[j:j+7]==check:
                    count+=1
            if count==1:
                ans="Yes"
                res=t
    print(ans)
    if ans=="Yes":
        print(res)


def count(string, substring): 
    count = 0
    start = 0
    while start < len(string): 
        pos = string.find(substring, start) 
        if pos != -1: 
            start = pos + 1
            count += 1
        else:
            break
    return count 
 

for _ in range(int(input())):
    n = int(input())
    os = input()
    good = False
    for i in range(n):
        if (os[i] == "a" or os[i] == "?") and i <= n-7:
            s = list(os)
            bad = False
            for j in range(i, i+7):
                if s[j] != "?" and s[j] != "abacaba"[j-i]:
                    bad = True
                    break
                s[j] = "abacaba"[j-i]
            if bad:
                continue
            ans = "".join(s).replace("?", "z")
            if count(ans, "abacaba") == 1:
                good = True
                break

    if good:
        print("Yes")
        print(ans)
    else:
        print("No")