#include <bits/stdc++.h>
using namespace std;
int cont(string s, string t) {
  int cnt = 0;
  for (int i = 0; i < s.length() - t.length() + 1; i++) {
    if (t.compare(s.substr(i, 7)) == 0) {
      cnt++;
    }
  }
  return cnt;
}
void comp(string s, string t, int &fake, int &real) {
  bool flag = false;
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == '?') {
      flag = true;
      continue;
    } else if (s[i] != t[i]) {
      return;
    }
  }
  if (flag == true) {
    fake++;
  } else {
    real++;
  }
}
void call(string s, string t) {
  bool ans = false;
  for (int i = 0; i < s.length() - t.length() + 1; i++) {
    string super = s.substr(i, t.length());
    bool flag = false;
    for (int j = 0; j < t.length(); j++) {
      if (s[i + j] == '?') {
        flag = true;
      } else if (s[i + j] != t[j]) {
        flag = false;
        break;
      }
    }
    if (flag == true) {
      ans = true;
      for (int j = 0; j < t.length(); j++) {
        s[i + j] = t[j];
      }
      if (cont(s, t) > 1) {
        ans = false;
        s = s.substr(0, i) + super + s.substr(i + 7);
      } else {
        for (int i = 0; i < s.length(); i++) {
          if (s[i] == '?') s[i] = 'e';
        }
        cout << "YES" << endl;
        cout << s << endl;
        return;
      }
    }
  }
  if (ans == false) cout << "NO" << endl;
}
void solve() {
  string t = "abacaba";
  int n;
  cin >> n;
  string s;
  cin >> s;
  int cnt_real = 0;
  int cnt_fake = 0;
  for (int i = 0; i < n - t.length() + 1; i++) {
    comp(s.substr(i, t.length()), t, cnt_fake, cnt_real);
  }
  if (cnt_real > 1) {
    cout << "NO" << endl;
    return;
  }
  if (cnt_real == 1) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      if (s[i] == '?') {
        cout << 'e';
      } else
        cout << s[i];
    }
    cout << endl;
    return;
  }
  if (cnt_fake == 0) {
    cout << "NO" << endl;
    return;
  }
  if (cnt_fake >= 1) {
    call(s, t);
  }
}
int main() {
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
