#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    rep(i, n) if (s[i] == '.') s[i] = 'G';

    rep(i, n - 2) {
        if (s[i] == 'S' && s[i + 1] == 'K' && s[i + 2] == 'G') {
            cout << "No" << '\n';
            return;
        }
        if (s[i + 2] == '.') {
            if (s[i] == 'S' && s[i + 1] == 'K') s[i + 2] = 'K';
            else s[i + 2] = 'G';
        }
    }
    cout << "Yes" << '\n';
    cout << s << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    solve();
    return 0;
}