// Author: Olaf Surgut (surgutti)
// Created on 01-10-2024 17:51:12
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define endl '\n'
#define st first
#define nd second
#define pb push_bask
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, b, a) for (int i = (b); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)

const int N = 100 + 7;

int n, a[N], b[N];

int dp[N][N][N];

bool jazda(int i, int j, int len) {
	debug(i, j, len);

	if (len == 0)
		return true;
	if (len == 1)
		return a[i] == b[j];
	if (dp[i][j][len])
		return dp[i][j][len] == 2;
	
	int ok = false;

	REP(k, len) {
		if (a[i] == b[j + k]) {
			debug("found", i, j, k, len);
			ok |= jazda(i + 1, j, k) & jazda(i + k + 1, j + k + 1, len - k - 1);
		}
	}

	dp[i][j][len] = ok + 1;
	debug(i, j, len, ok);

	return ok;
}

void gen(int i, int j, int len) {
	if (len == 0) {
		return;
	}

	cout << 'S';

	REP(k, len) {
		if (jazda(i + 1, j, k) && jazda(i + k + 1, j + k + 1, len - k - 1)) {
			gen(i + 1, j, k);
			cout << 'C';
			gen(i + k + 1, j + k + 1, len - k - 1);
	
			break;
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n;
	FOR(i, 1, n)
		cin >> a[i];
	FOR(i, 1, n)
		cin >> b[i];

	if (!jazda(1, 1, n)) {
		cout << "NO\n";
	}
	else {
		cout << "YES\n";
		gen(1, 1, n);
		cout << '\n';
	}

	return 0;
}