#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

using ll = int64_t;
using ul = uint64_t;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vl = vector<ll>;
using vul = vector<ul>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using sei = set<int>;
using sec = set<char>;
using sel = set<ll>;
using mii = map<int,int>;
using vvi = vector<vi>;
using vvd = vector<vd>;
using vvc = vector<vc>;
using vvb = vector<vb>;
using vvl = vector<vl>;
using mint = modint998244353;

int main() {
  string T;
  cin >> T;
  int size = T.size();
  if (size == 1) {
    cout << "Yes" << endl;
    if (T == ".") cout << "S" << endl;
    else cout << T << endl;
    return 0;
  }
  vector<set<string>> dp(size);
  string skg = "SKG";
  string result;
  char end;
  for (int i = 0; i < size - 1; i++) {
    for (int j = 0; j < 3; j++) {
      if (!(T[i] == skg[j] || T[i] == '.')) continue;
      for (int k = 0; k < 3; k++) {
        if (!(T[i + 1] == skg[k] || T[i + 1] == '.')) continue;
        string now;
        now += skg[j], now += skg[k];
        if (i == 0) {
          dp[i].insert(now);
          end = now[1];
          continue;
        }
        for (int l = 0; l < 3; l++) {
          if (!(T[i - 1] == skg[l] || T[i - 1] == '.')) continue;
          string bef;
          bef += skg[l], bef += skg[j];
          if (now != "KG" && dp[i - 1].count(bef)) {
            dp[i].insert(now);
            end = now[1];
          }
          else if (now == "KG" && (dp[i - 1].count("KK") || dp[i - 1].count("GK"))) {
            dp[i].insert(now);
            end = now[1];
          }
        }
      }
    }
    if (dp[i].size() == 0) {
      cout << "No" << endl;
      return 0;
    }
  }
  char cur = end;
  result.push_back(cur);
  for (int i = size - 2; i >= 0; i--) {
    for (int j = 0; j < 3; j++) {
      string bef;
      bef += skg[j], bef += cur;
      if (dp[i].count(bef)) {
        cur = skg[j];
        result += cur;
        break;
      }
    }
  }
  reverse(result.begin(), result.end());
  cout << "Yes" << endl;
  cout << result << endl;
}