#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	string s; cin >> s;
	if (s.find("SKG") != string::npos) {
		cout << "No" << endl;
		return 0;
	}
	int n = s.size();
	for (int i = 0; i < n - 1;) {
		if (s[i] == '.' &&s[i + 1] == '.') {
			s[i] = 'K';
			s[i + 1] = 'K';
			i = i + 2;
		}
		i++;
	}
	//	cout << s << endl;
	rep(i, s.size()) {
		if (s[i] != '.') continue;
		if (i != 0 && i != n - 1 || s[i - 1] == 'S' && s[i + 1] == 'G')s[i] = 'S';
		else s[i] = 'K';
	}
	cout << "Yes" << endl;;
	cout << s << endl;
	return 0;
}