#include <bits/stdc++.h>
using namespace std;
long long int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
long long int dy[] = {0, -1, -1, -1, 0, 1, 1, 1};
long long int dxx[] = {1, -1, 0, 0};
long long int dyy[] = {0, 0, -1, 1};
long long int mod = 1;
long long int modexpo(long long int x, long long int y) {
  if (y == 0) return 1;
  if (y % 2) {
    long long int viky = modexpo(x, y / 2);
    return (((x * viky) % mod) * viky) % mod;
  } else {
    long long int viky = modexpo(x, y / 2);
    return (viky * viky) % mod;
  }
}
bool isvalid(long long int x, long long int y, long long int n,
             long long int m) {
  return (x >= 0 && x < n && y >= 0 && y < m);
}
vector<long long int> v[100011];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    string s;
    cin >> s;
    n = s.length();
    string s2 = "abacaba";
    string temp = s;
    long long int ok = 1;
    long long int ans = 0;
    for (long long int i = 0; i < n - 6; i++) {
      ok = 1;
      for (long long int j = 0; j < 7; j++) {
        if (s[i + j] == s2[j]) {
          continue;
        } else {
          ok = 0;
          break;
        }
      }
      if (ok) {
        ans++;
      }
    }
    if (ans == 1) {
      for (long long int i = 0; i < n; i++) {
        if (s[i] == '?') {
          s[i] = 'z';
        }
      }
      cout << "Yes\n";
      cout << s << "\n";
    } else if (ans == 0) {
      ok = 1;
      for (long long int i = 0; i < n - 6; i++) {
        ok = 1;
        for (long long int j = 0; j < 7; j++) {
          if (s[i + j] == s2[j]) {
            continue;
          } else if (s[i + j] == '?') {
            continue;
          } else {
            ok = 0;
            break;
          }
        }
        if (ok) {
          for (long long int j = 0; j < 7; j++) {
            if (s[i + j] == '?') {
              s[i + j] = s2[j];
            }
          }
          for (long long int j = 0; j < n; j++) {
            if (s[j] == '?') {
              s[j] = 'z';
            }
          }
          ans = 0;
          for (long long int k = 0; k < n - 6; k++) {
            ok = 1;
            for (long long int j = 0; j < 7; j++) {
              if (s[k + j] == s2[j]) {
                continue;
              } else {
                ok = 0;
                break;
              }
            }
            if (ok) {
              ans++;
            }
          }
        }
        if (ans == 1) {
          ok = 1;
          break;
        } else {
          ok = 0;
          s = temp;
        }
      }
      if (ok) {
        cout << "Yes\n" << s << "\n";
      } else {
        cout << "NO\n";
      }
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
