#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxn = 105;

int n;
int a[maxn],b[maxn];
int f[maxn][maxn][maxn],g[maxn][maxn][maxn];

void output(int L,int l,int x)
{
	if(L==0) return;
	if(L==1)
	{
		cout<<"SC";
		return;
	}
	int mid=g[L][l][x];
	cout<<"S";
	output(mid-x,l+1,x);
	cout<<"C";
	int midl=mid-x+1;
	output(L-midl,l+midl,x+midl);
}

int main()
{
	ios_base::sync_with_stdio(false);
	
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) cin>>b[i];
	
	for(int i=0;i<=n+1;i++) for(int j=0;j<=n+1;j++)
		f[0][i][j]=1;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(a[i]==b[j])
		f[1][i][j]=1;
	for(int L=2;L<=n;L++)
	{
		for(int l=1;l+L-1<=n;l++)
		{
		//	int r=L+l-1;
			for(int x=1;x+L-1<=n;x++)
			{
				int y=x+L-1;
				for(int mid=x;mid<=y;mid++) if(a[l]==b[mid])
				{
					int midl=mid-x+1;
					if(f[midl-1][l+1][x] && f[L-midl][l+midl][x+midl])
					{
						f[L][l][x]=1;
						g[L][l][x]=mid;
					}
				}
			}
		}
	}
	if(f[n][1][1])
	{
		cout<<"YES\n";
		output(n,1,1);
		cout<<'\n';
	}
	else cout<<"NO\n";
	
	return 0;
}