Problem: 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 ≤ i ≤ 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 ≤ T ≤ 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 ≤ n ≤ 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.

Solution (in JAVA):

Solution:
// package com.company;

import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
//****Use Integer Wrapper Class for Arrays.sort()****
public class EB1 {
    static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));
    public static void main(String[] Args)throws Exception{
        FastReader scan=new FastReader(System.in);
        int t=1;
        t=scan.nextInt();
        int[] lps=new int[7];
        computeLPSArray("abacaba",7,lps);
        while(t-->0){
            int n=scan.nextInt();
            String s=scan.next();
            String pat="abacaba";
//            out.println(pat.length());
            StringBuilder ans=new StringBuilder(s);
            int c=0;
            for(int i=0;i<n-6;i++){
                int j=0;
                for(;j<pat.length();){
                    if(ans.charAt(i+j)==pat.charAt(j)){
                        j++;
                    }else{
                        break;
                    }
                }
                if(j==pat.length()){
                    c++;
                }
            }
            if(c>1){
                out.println("NO");
            }else if(c==1){
                out.println("YES");
                for(int i=0;i<n;i++){
                    if(ans.charAt(i)=='?'){
                        ans.setCharAt(i,'d');
                    }
                }
                out.println(ans);
            }else{
                boolean pos = false;
                for (int i = 0; i < n - 6; i++) {
                    int j = 0;
                    for (; j < pat.length();) {
                        if (ans.charAt(i + j) == pat.charAt(j) || ans.charAt(i + j) == '?') {
                            j++;
                        } else {
                            break;
                        }
                    }
                    if (j == pat.length()) {
                        pos = true;
                        ArrayList<Integer> qs = new ArrayList<>();
                        for (int k = 0; k < pat.length(); k++) {
                            if (ans.charAt(i + k) == '?') {
                                ans.setCharAt(i + k, pat.charAt(k));
                                qs.add(i+k);
                            }
                        }
                        int f=KMPSearch(pat,ans.toString(),lps);
                        if(f>1){
                            pos=false;
                        }
                        if(!pos){
                            for(Integer k:qs){
                                ans.setCharAt(k,'?');
                            }
                            if(ans.charAt(i)=='?'){
                                ans.setCharAt(i,'d');
                            }
                        }else{
                            break;
                        }
                    }
                }
                if(pos){
                    out.println("YES");
                    for(int i=0;i<n;i++){
                        if(ans.charAt(i)=='?'){
                            ans.setCharAt(i,'d');
                        }
                    }
                    out.println(ans);
                }else{
                    out.println("NO");
                }
            }
        }
        out.flush();
        out.close();
    }
    static int KMPSearch(String pat, String txt,int[] lps)
    {
        int M = pat.length();
        int N = txt.length();

        int j = 0; // index for pat[]
        int c=0;
        int i = 0; // index for txt[]
        while (i < N) {
            if (pat.charAt(j) == txt.charAt(i)) {
                j++;
                i++;
            }
            if (j == M) {
                j = lps[j - 1];
                c++;
            }

            // mismatch after j matches
            else if (i < N && pat.charAt(j) != txt.charAt(i)) {
                // Do not match lps[0..lps[j-1]] characters,
                // they will match anyway
                if (j != 0)
                    j = lps[j - 1];
                else
                    i = i + 1;
            }
        }
        return c;
    }

    static void computeLPSArray(String pat, int M, int lps[])
    {
        // length of the previous longest prefix suffix
        int len = 0;
        int i = 1;
        lps[0] = 0; // lps[0] is always 0

        // the loop calculates lps[i] for i = 1 to M-1
        while (i < M) {
            if (pat.charAt(i) == pat.charAt(len)) {
                len++;
                lps[i] = len;
                i++;
            }
            else // (pat[i] != pat[len])
            {
                // This is tricky. Consider the example.
                // AAACAAAA and i = 7. The idea is similar
                // to search step.
                if (len != 0) {
                    len = lps[len - 1];

                    // Also, note that we do not increment
                    // i here
                }
                else // if (len == 0)
                {
                    lps[i] = len;
                    i++;
                }
            }
        }
    }
    static class FastReader {

        byte[] buf = new byte[2048];
        int index, total;
        InputStream in;

        FastReader(InputStream is) {
            in = is;
        }

        int scan() throws IOException {
            if (index >= total) {
                index = 0;
                total = in.read(buf);
                if (total <= 0) {
                    return -1;
                }
            }
            return buf[index++];
        }

        String next() throws IOException {
            int c;
            for (c = scan(); c <= 32; c = scan()) ;
            StringBuilder sb = new StringBuilder();
            for (; c > 32; c = scan()) {
                sb.append((char) c);
            }
            return sb.toString();
        }

        int nextInt() throws IOException {
            int c, val = 0;
            for (c = scan(); c <= 32; c = scan()) ;
            boolean neg = c == '-';
            if (c == '-' || c == '+') {
                c = scan();
            }
            for (; c >= '0' && c <= '9'; c = scan()) {
                val = (val << 3) + (val << 1) + (c & 15);
            }
            return neg ? -val : val;
        }
        long nextLong() throws IOException {
            int c;
            long val = 0;
            for (c = scan(); c <= 32; c = scan()) ;
            boolean neg = c == '-';
            if (c == '-' || c == '+') {
                c = scan();
            }
            for (; c >= '0' && c <= '9'; c = scan()) {
                val = (val << 3) + (val << 1) + (c & 15);
            }
            return neg ? -val : val;
        }
    }
}