#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
	x=0;short f=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
	for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
	x*=f;return;
}
const int N=1205;
char s[N];
int a[N],b[N];
namespace path{
	void Main()
	{
		int n;
		scanf("%d",&n);
		n<<=1;
		scanf("%s",s);
		for(int i=0;i<n;++i)
			a[i]=a[n+i]=(s[i]=='R'?1:-1);
		a[n]=-1;
		int mn=0,pos=0;
		for(int i=0,s=0;i<=n;++i)
		{
			s+=a[i];
			if(mn>s)
			{
				mn=s;
				pos=i+1;
			}
		}
		if(pos==n+1)
			pos=0;
		int k=-1;
		for(int i=0,s=0;i<=n;++i)
		{
			b[i]=a[(pos+i)%(n+1)];
			if(b[i]==-1)
			{
				if(pos+i==n)
					k=s;
				++s;
			}
		}
		for(int i=0;i<n;++i)
			putchar(b[i]>0?'(':')');
		printf("\n%d\n",k);
	}
}
namespace brackets{
	void Main()
	{
		int n,k;
		scanf("%d",&n);
		n<<=1;
		scanf("%s%d",s,&k);
		for(int i=0;i<n;++i)
			b[i]=(s[i]=='('?1:-1);
		b[n]=-1;
		for(int i=0,s=0;i<=n;++i)
			if(b[i]==-1)
			{
				if(k==s)
				{
					for(int j=(i+1)%(n+1);j!=i;j=(j+1)%(n+1))
						putchar(b[j]>0?'R':'U');
					putchar(10);
					break;
				}
				++s;
			}
	}
}
int main()
{
	char s[9];
	scanf("%s",s);
	s[0]=='p'?path::Main():brackets::Main();
	return 0;
}