#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e3+10;
struct QF{
	string lx;
	int x,xx,y,yy,r;
	char fh;
}q[N];
unordered_map<int,char> mp;
vector<pair<int,int> > lie;
bool cmp(pair<int,int> a,pair<int,int> b){
	if(a.second==b.second){
		return a.first>b.first;
	}
	else return a.second>b.second;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> q[i].lx;
		if(q[i].lx=="Circle"){
			cin >> q[i].x >> q[i].y >> q[i].r >> q[i].fh;
		}
		else if(q[i].lx=="Rectangle"){
			cin >> q[i].x >> q[i].y >> q[i].xx >> q[i].yy >> q[i].fh;
		}
		else{
			cin >> q[i].x >> q[i].y >> q[i].xx >> q[i].yy;
			for(int k=q[i].x;k<=q[i].xx;k++){
				for(int j=q[i].y;j<=q[i].yy;j++){
					lie.push_back({k,j});
				}
			}
		}
	}
	sort(lie.begin(),lie.end(),cmp);
	lie.erase(unique(lie.begin(),lie.end()),lie.end());
	int len1=lie.size();
	for(int i=0;i<len1;i++){
		mp[i]='.';
	}
//	for(int i=0;i<len1;i++){
//		cout << lie[i].first << " " << lie[i].second << "\n";
//	}
//	cout << len1 << "\n";
	for(int i=1;i<=n;i++){
		int len=lie.size();
		if(q[i].lx=="Render"){
//			int chang;
			int js=0;
			for(int j=0;j<len;j++){
				int qian=q[i].y;
				if(lie[j].first>=q[i].x&&lie[j].first<=q[i].xx&&lie[j].second>=q[i].y&&lie[j].second<=q[i].yy){
					js++;
					cout << mp[j];
					if(qian<lie[j].second){
						qian=lie[j].second;
					}
//					int chang=q[i].xx-q[i].x+1;
					if(js%(q[i].yy-q[i].y+1)==0){
						cout << "\n";				
					}
				}
			}
//			cout << "\n";
//			cout << "\n" << chang << "\n";
			continue;
		}
		for(int j=0;j<len;j++){
			if(q[i].lx=="Circle"){
				if((lie[j].first-q[i].x)*(lie[j].first-q[i].x)+(lie[j].second-q[i].y)*(lie[j].second-q[i].y)<=q[i].r*q[i].r){
					mp[j]=q[i].fh;
				}
			}
			else{
				if(lie[j].first>=q[i].x&&lie[j].first<=q[i].xx&&lie[j].second>=q[i].y&&lie[j].second<=q[i].yy){
					mp[j]=q[i].fh;
				}
			}
		}
	}
	return 0;
}