#include <bits/stdc++.h>
#define endl '\n'
#define buff ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
/*
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize(3)
*/
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pair<ll, ll>> vpll;
const ll MAX_INT = 0x3f3f3f3f;
const ll MAX_LL = 0x3f3f3f3f3f3f3f3f;
const ll CF = 2e5 + 9;
const ll mod = 1e9 + 7;
struct op {
	ll x1, y1, r;
	char col;
	ll x2, y2;
	ll op_num;
	ll when;
};
struct Render{
	ll x1, y1, x2, y2, when;
};
ll n;
vector<op> v;
vector<Render> prepare_ans;
void solve() {
	cin >> n;
	string str;
	for (int i = 1; i <= n; i++) {
		cin >> str;
		if (str[0] == 'C') {
			ll x, y, r;
			char col;
			cin >> x >> y >> r >> col;
			v.push_back({x, y, r, col, 0, 0, 1, i});
		} else if (str[0] == 'R' && str[2] == 'c') {
			ll x1, y1, x2, y2;
			char col;
			cin >> x1 >> y1 >> x2 >> y2 >> col;
			v.push_back({x1, y1, 0, col, x2, y2, 2, i});
		} else {
			ll x1, y1, x2, y2;
			cin >> x1 >> y1 >> x2 >> y2;
			prepare_ans.push_back({x1, y1, x2, y2, i});
		}
	}
	for (auto &[x1, y1, x2, y2, when] : prepare_ans) {
		for (ll j = y2; j >= y1; j--) {
			for (ll i = x2; i >= x1; i--) {
				ll flag = 0;
				for (int k = (ll)v.size() - 1; k >= 0; k--) {
					if(v[k].when > when) continue;
					if (v[k].op_num == 1) {
						if ((i - v[k].x1) * (i - v[k].x1) + (j - v[k].y1) * (j - v[k].y1) <= v[k].r * v[k].r) {
							cout << v[k].col;
							flag = 1;
							break;
						}
					} else {
						if (i >= v[k].x1 && i <= v[k].x2 && j >= v[k].y1 && j <= v[k].y2) {
							cout << v[k].col;
							flag = 1;
							break;
						}
					}
				}
				if (flag == 0)
					cout << '.';
			}
			cout << endl;
		}
	}
}

int main() {
	int t = 1;
	//	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}
/*

8
Render -1 0 1 2
Circle 0 0 5 *
Circle -2 2 1 @
Render -5 -5 5 5
Circle 2 2 1 @
Rectangle 0 -1 0 0 ^
Rectangle -2 -2 2 -2 _
Render -5 -5 5 5


*/