#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[105];
int b[105];
int dp[105][105][105];
int good[105][105][105];
int pre[105][105][105];
int type[105][105][105];
struct PolyHash{
	/*
	WARNING: make sure the values in the array or string are in the range [0,5e8]
	*/
	vector<int>powers;
	vector<int>powers2;
	vector<int>hashes;
	vector<int>hashes2;
	int seed = 500002961;
	int seed2 = 500003263;
	const int mod = (int)1e9+7;
	const int mod2 = 998244353;
	vector<int>arr;
	void init(int n){
		powers.resize(n+5); powers[0] = 1;
		powers2.resize(n+5); powers2[0] = 1;
		hashes.resize(n+5);
		hashes2.resize(n+5);
		for(int i = 1; i<=n; i++){
			powers[i] = powers[i-1]*seed; powers[i]%=mod;
			powers2[i] = powers2[i-1]*seed2; powers2[i]%=mod2;
		}
		for(int i = 1; i<=n; i++){
			hashes[i] = hashes[i-1]*seed+arr[i]; hashes[i]%=mod;
			hashes2[i] = hashes2[i-1]*seed2+arr[i]; hashes2[i]%=mod2;
		}
	}
	void init(int n, string s){//string is 0 indexed
		arr.resize(n+5);
		for(int i = 1; i<=n; i++){
			arr[i] = s[i-1];
		}
		init(n);
	}
	void init(int n, vector<int>a){//a is 1 indexed
		arr.resize(n+5);
		for(int i = 1; i<=n; i++){
			arr[i] = a[i];
		}
		init(n);
	}
	pair<int,int> subhash(int l, int r){//inclusive
		int hsh = hashes[r]-hashes[l-1]*powers[r-l+1]%mod; hsh+=mod; hsh%=mod;
		int hsh2 = hashes2[r]-hashes2[l-1]*powers2[r-l+1]%mod2; hsh2+=mod2; hsh2%=mod2;
		return {hsh,hsh2};
	}
};
string f(int l, int i, int j){
	if(l == 1){
		return "SC";
	}
	if(type[l][i][j] == 2){
		int len = pre[l][i][j];
		return f(len,i,j) + f(l-len,i+len,j+len);
	}
	int len = pre[l][i][j];
	string s = "";
	for(int i = 0; i<len; i++){
		s.push_back('S');
	}
	s+=f(l-len,i+len,j);
	for(int i = 0; i<len; i++){
		s.push_back('C');
	}
	return s;
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int>arr(n+1);
	for(int i = 1; i<=n; i++){
		cin >> a[i];
		arr[i] = a[i];
	}
	vector<int>arr2(n+1);
	for(int i = 1; i<=n; i++){
		cin >> b[i];
		arr2[i] = b[i];
	}
	reverse(arr2.begin()+1,arr2.end());
	PolyHash hsh;
	hsh.init(n,arr);
	PolyHash hsh2;
	hsh2.init(n,arr2);
	for(int l = 1; l<=n; l++){
		for(int i = 1; i+l-1<=n; i++){
			for(int j = 1; j+l-1<=n; j++){
				if(hsh.subhash(i,i+l-1) == hsh2.subhash(n-(j+l-1)+1,n-j+1)){
					good[l][i][j] = 1;
					//cout << l << ' ' << i << ' ' << j << '\n';
				}
			}
		}
	}
	for(int i = 1; i<=n; i++){
		for(int j = 1; j<=n; j++){	
			if(a[i] == b[j]){
				dp[1][i][j] = 1;
			}
		}
	}
	for(int l = 1; l<n; l++){
		for(int i = 1; i+l-1<=n; i++){
			for(int j = 1; j+l-1<=n; j++){
				if(!dp[l][i][j])continue;
				for(int k = 1; k<=n; k++){
					if(k>i || k>j)break;
					if(dp[k][i-k][j-k]){
						dp[l+k][i-k][j-k] = 1;
						pre[l+k][i-k][j-k] = k;
						type[l+k][i-k][j-k] = 2;
					}
				}
				for(int k = 1; k<=n; k++){
					if(k>i || j+l+k-1>n)break;
					if(good[k][i-k][j+l]){
						dp[l+k][i-k][j] = 1;
						pre[l+k][i-k][j] = k;
						type[l+k][i-k][j] = 1;
					}
				}
				for(int k = 1; k<=n; k++){
					if(i+l+k-1 >n || j+l+k-1 > n)break;
					if(dp[k][i+l][j+l]){
						dp[l+k][i][j] = 1;
						pre[l+k][i][j] = l;
						type[l+k][i][j] = 2;
					}
				}
			}
		}
	}
	if(dp[n][1][1]){
		//cout << type[n][1][1] << '\n';
		//cout << pre[n][1][1] << '\n';
		cout << "YES\n";
		cout << f(n,1,1) << '\n';
	}
	else{
		cout << "NO\n";
	}
	return 0;
}