F

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
using namespace std;
using ll = long long;
using ld = long double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}
void cvch(vector <vector <char > > v){
    for (auto x: v) {
            for (auto y: x)cout<<y;
            cout<<"\n";
    }cout<<"\n";
}
vector <vector <char> > wall(5, vector <char> (30));
vector <vector <char >> pattern(5, vector <char> (30, '.'));
vector <pii> idx;


bool was(vector <vector<char>> v){
    for (int j = 0; j < )
}
int main()
{
    /*ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);*/
    idx = {{2, 2}, {2, 7}, {2, 12}, {2, 17}, {2, 22}, {2, 27}};
    vector <pair<char, char> > clr = {{'R', 'B'}, {'B', 'R'}, {'G', 'B'}, {'R', 'G'}, {'G', 'R'}, {'B', 'G'}};
    vector <int> dx, dy;
    dx = {-1, -1, 0, 1, 1, 1, 0, -1};
    dy  = {0, 1, 1, 1, -1, 0, -1, -1, -1};
    for (int k=0;k<6;++k){
        auto cr = idx[k];
        int i = cr.first, j = cr.second;
        pattern[i][j] = clr[k].second;
        for (int t = 0;t<8;++t){
            pattern[i+dx[t]][j+dy[t]] = clr[k].first;
        }
    }
    for (int i=0;i<5;++i) for (int j=0;j<30;++j)cin>>wall[i][j];
    //cvch(wall);
    if (was(wall)) cout<<"Yes\n";
    else {
        cout<<"No\n";
        cvch(pattern);
    }
}
/*
RGB....RGB...RGB..........RGB.


WWWWRRRBRHMVEGGGIJTMKWBBBWWRRR
WWWWRLORALVBZGAMGNCBXKBWWBWRGR
WWWWRRRASXDCFGVRBGJNLMBBBWWRRR
WWWWRWRWUERPTGEGRLWWWWBWWBWRGB
WWWWRWWRWWWWWWGGGWWWWWBBBWWRGW
*/