#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 50;
const long long mod = 1e9 + 7;
const long long INF = 1000000000;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
bool compare(const pair<long long, long long>& i,
             const pair<long long, long long>& j) {
  return i.second < j.second;
}
long long fact[N];
vector<bool> is_prime(100000, true);
vector<int> prime;
void pre() {
  fact[0] = 1;
  for (long long i = 1; i < N; i++) {
    fact[i] = i * fact[i - 1];
    fact[i] %= mod;
  }
}
long long modexp(long long x, long long n) {
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return r % mod;
}
long long modinv(long long x) { return modexp(x, mod - 2); }
long long ncr(long long n, long long r) {
  if (n < r) return 0;
  long long ans =
      (fact[n] % mod * modinv(fact[r]) % mod * modinv(fact[n - r]) % mod) % mod;
  return ans;
}
void solve() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  string s1 = "abacaba";
  int cnt = 0;
  int flag = 0;
  for (int i = 0; i < n - 6; i++) {
    if (s.substr(i, 7) == s1) {
      flag = 1;
      cnt++;
    }
  }
  if (cnt > 1) {
    cout << "No"
         << "\n";
    return;
  }
  if (cnt == 1) {
    cout << "Yes"
         << "\n";
    for (int i = 0; i < n; i++) {
      if (s[i] == '?')
        cout << 'd';
      else
        cout << s[i];
    }
    cout << "\n";
    return;
  }
  int cnt1 = 0;
  for (int i = 0; i < n - 6; i++) {
    int j = i, flag = 1;
    for (int j = 0; j < 7; j++) {
      if (s[i + j] == s1[j] or s[i + j] == '?') continue;
      flag = 0;
      break;
    }
    if (flag == 1) {
      if (j + 7 + 3 < n and s.substr(j + 7, 4) == "caba") continue;
      if (i >= 4 and s.substr(i - 4, 4) == "abac") continue;
      if (j + 7 + 5 < n and s.substr(j + 7, 6) == "bacaba") continue;
      if (i >= 6 and s.substr(i - 6, 6) == "abacab") continue;
      j = i;
      for (int k = 0; k < 7; k++) s[j + k] = s1[k];
      cout << "Yes"
           << "\n";
      for (int i = 0; i < n; i++) {
        if (s[i] == '?') s[i] = 'd';
      }
      cout << s << "\n";
      return;
    }
  }
  cout << "No"
       << "\n";
  return;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  for (int i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
