#include <bits/stdc++.h>
using namespace std;
int main() {
  int tc, n, cnt;
  char s[55], t[55];
  bool valid, match, found;
  string x = "abacaba";
  scanf("%d", &tc);
  while (tc--) {
    scanf("%d %s", &n, s);
    found = false;
    for (int i = 6; i < n; i++) {
      valid = true;
      for (int j = 0; j < 7; j++)
        if ((s[i + j - 6] != x[j]) && (s[i + j - 6] != '?')) {
          valid = false;
          break;
        }
      if (valid) {
        for (int j = 0; j < i - 6; j++) {
          t[j] = s[j];
          if (t[j] == '?') t[j] = 'z';
        }
        for (int j = 0; j < 7; j++) t[i + j - 6] = x[j];
        for (int j = i + 1; j < n; j++) {
          t[j] = s[j];
          if (t[j] == '?') t[j] = 'z';
        }
        cnt = 0;
        for (int j = 6; j < n; j++) {
          match = true;
          for (int k = 0; k < 7; k++)
            if (t[j + k - 6] != x[k]) {
              match = false;
              break;
            }
          if (match) cnt++;
        }
        if (cnt == 1) {
          found = true;
          puts("Yes");
          for (int j = 0; j < n; j++) putchar(t[j]);
          puts("");
          break;
        }
      }
    }
    if (!found) puts("No");
  }
  return 0;
}
