/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
string op[2005];
int X1[2005],X2[2005],Y1[2005],Y2[2005],n;
char col[2005];
void calc(int x,int y)
{
	char ch='.';
	for(int i=1;i<=n;i++)
	{
		if(op[i]=="Circle")
		{
			if((x-X1[i])*(x-X1[i])+(y-Y1[i])*(y-Y1[i])<=X2[i]*X2[i]) ch=col[i];
		}
		else
		{
			if(X1[i]<=x&&x<=X2[i]&&Y1[i]<=y&&y<=Y2[i]) ch=col[i];
		}
	}
	cout<<ch;
}
void solve()
{
	int Q;
	cin>>Q;
	while(Q--)
	{
		string s;
		cin>>s;
		if(s=="Circle") 
		{
			n++;
			op[n]=s;
			cin>>X1[n]>>Y1[n]>>X2[n]>>col[n];
		}
		if(s=="Rectangle")
		{
			n++;
			op[n]=s;
			cin>>X1[n]>>Y1[n]>>X2[n]>>Y2[n]>>col[n];
		}
		if(s=="Render")
		{
			int x1,y1,x2,y2;
			cin>>x1>>y1>>x2>>y2;
			for(int i=y2;i>=y1;i--)
			{
				for(int j=x1;j<=x2;j++) calc(j,i);
				cout<<"\n";
			}
		}
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}