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:
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.Flushable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Main {
	static Reader in = new Reader(System.in);
	static Writer out = new Writer(System.out);

	public static void main(String[] args) throws IOException {

		// read input
		int num = in.nextInt();
		for (int t = 0; t < num; t++) {
			int n = in.nextInt();
			String input = in.next();
			String res = solve(input);
			if (res == null) {
				out.println("No");
			} else {
				out.println("Yes");
				out.println(res);
			}
		}

		// print output
		//out.println();

		// close stuff
		in.close();
		out.flush();
		out.close();
	}

	private static final String code = "abacaba";

	private static String solve(String input) {
		for (int i = 0; i < input.length(); i++) {
			if (input.charAt(i) == 'a' || input.charAt(i) == '?') {
				String res = test(input, i);
				if (res != null) {
					int count = 0;
					for (int j = 0; j <= res.length() - code.length(); j++) {
						if (res.substring(j, j + code.length()).equals(code)) count++;
					}
					if (count == 1) return zzz(res);
				}
			}
		}

		return null;
	}

	private static String test(String input, int i) {
		char[] a = input.toCharArray();
		char[] b = code.toCharArray();
		for (int j = 0; j < code.length(); j++) {
			if (i+j >= a.length) return null;
			if (a[i+j] == b[j]) continue;
			if (a[i+j] == '?') {
				a[i + j] = b[j];
				continue;
			}
			return null;
		}

		return new String(a);
	}

	private static String zzz(String input) {
		return input.replaceAll("\\?", "z");
	}

	static class Reader implements Closeable {

		private final BufferedReader reader;
		private StringTokenizer tokenizer;

		public Reader(InputStream input) {
			reader = new BufferedReader(
					new InputStreamReader(input));
			tokenizer = new StringTokenizer("");
		}

		private StringTokenizer getTokenizer() throws IOException {
			if (tokenizer == null || !tokenizer.hasMoreTokens()) {
				String line = nextLine();
				if (line == null) {
					return null;
				}
				tokenizer = new StringTokenizer(line);
			}
			return tokenizer;
		}

		public boolean hasNext() throws IOException {
			return getTokenizer() != null;
		}

		public String next() throws IOException {
			return hasNext() ? tokenizer.nextToken() : null;
		}

		public String nextLine() throws IOException {
			tokenizer = null;
			return reader.readLine();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public float nextFloat() throws IOException {
			return Float.parseFloat(next());
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public String[] nextStringArray(int size) throws IOException {
			String[] array = new String[size];
			for (int i = 0; i < size; i++) {
				array[i] = next();
			}
			return array;
		}

		public int[] nextIntArray(int size) throws IOException {
			int[] array = new int[size];
			for (int i = 0; i < size; i++) {
				array[i] = nextInt();
			}
			return array;
		}

		public long[] nextLongArray(int size) throws IOException {
			long[] array = new long[size];
			for (int i = 0; i < size; i++) {
				array[i] = nextLong();
			}
			return array;
		}

		public double[] nextDoubleArray(int size) throws IOException {
			double[] array = new double[size];
			for (int i = 0; i < size; i++) {
				array[i] = nextDouble();
			}
			return array;
		}

		@Override
		public void close() throws IOException {
			tokenizer = null;
			reader.close();
		}
	}

	static class Writer implements Closeable, Flushable {

		private final PrintWriter writer;

		public Writer(OutputStream outputStream) {
			writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
		}

		public void print(Object... objects) {
			for (int i = 0; i < objects.length; i++) {
				if (i != 0) {
					writer.print(' ');
				}
				writer.print(objects[i]);
			}
		}

		public void println(Object... objects) {
			print(objects);
			writer.println();
		}

		@Override
		public void close() {
			writer.close();
		}

		@Override
		public void flush() {
			writer.flush();
		}
	}


}