#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int n, long long int mod) {
  long long int res = 1;
  x %= mod;
  while (n) {
    if (n & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return res;
}
void solve() {
  long long int n;
  cin >> n;
  string a;
  cin >> a;
  auto tt = a.find("abacaba");
  if (tt != string::npos) {
    if (a.find("abacaba", tt + 1) != string::npos) {
      cout << "No";
      return;
    }
    string ans;
    for (long long int i = 0; i < n; ++i) {
      if (a[i] == '?') {
        ans.push_back('d');
      } else {
        ans.push_back(a[i]);
      }
    }
    cout << "Yes\n" << ans;
    return;
  }
  long long int hh;
  long long int f = 0;
  for (long long int i = 0; i < n - 6; ++i) {
    if ((a[i] == 'a' || a[i] == '?') && (a[i + 1] == 'b' || a[i + 1] == '?') &&
        (a[i + 2] == 'a' || a[i + 2] == '?') &&
        (a[i + 3] == 'c' || a[i + 3] == '?') &&
        (a[i + 4] == 'a' || a[i + 4] == '?') &&
        (a[i + 5] == 'b' || a[i + 5] == '?') &&
        (a[i + 6] == 'a' || a[i + 6] == '?')) {
      if (a.find("caba", i + 7) == i + 7) {
        if (a.find("abac", i) == i) {
          i += 7;
          continue;
        }
        i += 3;
        continue;
      }
      if (a.find("bacaba", i + 7) == i + 7) {
        if (a.find("abacab?bacaba", i) == i) {
          i += 9;
          continue;
        }
        i += 5;
        continue;
      }
      f = 1;
      hh = i;
      break;
    }
  }
  if (f == 0) {
    cout << "No";
    return;
  }
  string ans;
  for (long long int i = 0; i < n; ++i) {
    if (i == hh) {
      ans.push_back('a');
      ans.push_back('b');
      ans.push_back('a');
      ans.push_back('c');
      ans.push_back('a');
      ans.push_back('b');
      ans.push_back('a');
      i += 6;
    } else {
      if (a[i] == '?')
        ans.push_back('d');
      else {
        ans.push_back(a[i]);
      }
    }
  }
  cout << "Yes\n" << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
