#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define db double
#define il inline
#define x first
#define y second
#define endl '\n'
const int N = 4e3 + 5;
const int mod = 998244353;
struct node
{
    int op;
    int x, y, r; char p;
    int x1, y1, x2, y2;
}qx[N];
struct node2
{
    int x1, y1, x2, y2, id;
}pt[N];
void solve()
{
    int n;
    cin >> n;
    int cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        string s;
        cin >> s;
        if (s[0] == 'C') 
        {
            qx[i].op = 1;
            cin >> qx[i].x >> qx[i].y >> qx[i].r >> qx[i].p;
        }
        else if (s[2] == 'c')
        {
            qx[i].op = 2;
            cin >> qx[i].x1 >> qx[i].y1 >> qx[i].x2 >> qx[i].y2 >> qx[i].p;
        }
        else 
        {
            int x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;
            pt[++cnt] = {x1, y1, x2, y2, i};
        }   
    }
    for (int i = 1; i <= cnt; i++)
    {
        auto [x1, y1, x2, y2, id] = pt[i];
        for (int y = y2; y >= y1; y--)
        {
            for (int x = x2; x >= x1; x--)
            {
                char s = '.';
                for (int j = 1; j < id; j++)
                {
                    if (qx[j].op == 1)
                    {
                        int x1 = qx[j].x, y1 = qx[j].y, r = qx[j].r;
                        if ((x1 - x) * (x1 - x) + (y1 - y) * (y1 - y) <= r * r) s = qx[j].p;
                    }
                    else if (qx[j].op == 2)
                    {
                        int x1 = qx[j].x1, y1 = qx[j].y1, x2 = qx[j].x2, y2 = qx[j].y2;
                        if (x1 <= x && x <= x2 && y1 <= y && y <= y2) s = qx[j].p;
                    }
                }
                cout << s;
            }
            cout << '\n';
        }
    }
}
signed main()
{
    // freopen("D:\\3022244240\\vscode\\txt\\in.txt", "r", stdin);
    // freopen("D:\\3022244240\\vscode\\txt\\out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T = 1; // cin >> T;
    while (T--) solve();
    return 0;
}