#include <bits/stdc++.h>   using namespace std;   void solve() {     int n;     string s, t, ss;     cin >> n >> s;     ss = s;     t =  abacaba ;     int cnt = 0;     for (int i = 0; i < n - 6; i++) {       int j, k = 0;       for (j = i; j < i + 7; j++) {         if (s[j] != t[k]) break;         k++;       }       if (j == i + 7) cnt++;     }     if (cnt == 1) {       cout <<  Yes             <<   n ;       for (int i = 0; i < n; i++) {         if (s[i] ==  ? ) s[i] =  z ;       }       cout << s <<   n ;     } else if (cnt > 1) {       cout <<  No             <<   n ;       return;     } else {       cnt = 0;       for (int i = 0; i < n - 6; i++) {         cnt = 0;         int j, k = 0;         for (j = i; j < i + 7; j++) {           if (s[j] != t[k] && s[j] !=  ? ) break;           s[j] = t[k];           k++;         }         if (j == i + 7) {           for (int x = 0; x < n - 6; x++) {             int y, z = 0;             for (y = x; y < x + 7; y++) {               if (s[y] != t[z]) break;               z++;             }             if (y == x + 7) cnt++;           }           if (cnt == 1) {             cout <<  Yes                   <<   n ;             for (int i = 0; i < n; i++) {               if (s[i] ==  ? ) s[i] =  z ;             }             cout << s <<   n ;             return;           } else {             for (int i = 0; i < n; i++) s[i] = ss[i];           }         } else {           for (int i = 0; i < n; i++) s[i] = ss[i];         }       }       cout <<  No             <<   n ;     }   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     long long tt;     cin >> tt;     while (tt--) solve();     return 0;   }   