#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct Graph {
    int moe;
    ll x1, y1;
    ll x2, y2;
    ll r;
    char c;
};

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int n;
    cin >> n;

    vector<Graph> a;
    for (int q = 1; q <= n; ++q) {
        string op;
        cin >> op;
        if (op[0] == 'C') {
            ll x, y, r;
            char c;
            cin >> x >> y >> r >> c;
            Graph now;
            now.moe = 0;
            now.x1 = x - r;
            now.y1 = y - r;
            now.x2 = x + r;
            now.y2 = y + r;
            now.r = r;
            now.c = c;
            a.push_back(now);
        } else if (op[0] == 'R' && ssize(op) > 6) {
            ll x1, y1, x2, y2;
            char c;
            cin >> x1 >> y1 >> x2 >> y2 >> c;
            Graph now;
            now.moe = 1;
            now.x1 = x1; now.x2 = x2;
            now.y1 = y1; now.y2 = y2;
            now.r = 0;
            now.c = c;
            a.push_back(now);
        } else {
            ll x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;
            
            vector ans(x2 - x1 + 10, vector(y2 - y1 + 10, '.'));
            for (int i = 0; i < ssize(a); ++i) {
                // if ((x1 <= a[i].x1 && y1 <= a[i].y1) || (a[i].x2 <= x2 && a[i].y2 <= y2) || ()) {
                    if (a[i].moe == 0) {
                        ll x = a[i].x1 + a[i].r;
                        ll y = a[i].y1 + a[i].r;
                        ll r = a[i].r;
                        // cerr << x << " " << y << " yuanxin\n";
                        x -= x1;
                        y -= y1;
                        // cerr << x << " " << y << " yuanxin\n";
                        ll cnt = 0;
                        ll num = r;
                        for (int j = x; j <= min(x + r, x2 - x1); ++j) {
                            if (0 <= j && j <= x2 - x1) {
                                for (int k = max(y - num, 0LL); k <= min(y + num, y2 - y1); ++k) {
                                    // cerr << k << " nowk\n";
                                    ans[j][k] = a[i].c;
                                }
                            }
                            cnt++;
                            num = sqrt(r * r - cnt * cnt);
                        }
                        cnt = 1;
                        num = sqrt(r * r - cnt * cnt);
                        for (int j = x - 1; j >= max(x - r, 0LL); --j) {
                            if (0 <= j && j <= x2 - x1) {
                                for (int k = max(y - num, 0LL); k <= min(y + num, y2 - y1); ++k) {
                                    ans[j][k] = a[i].c;
                                }
                            }
                            cnt++;
                            num = sqrt(r * r - cnt * cnt);
                        }
                    } else {
                        for (int j = max(0LL, a[i].x1 - x1); j <= min(x2 - x1, a[i].x2 - x1); ++j) {
                            for (int k = max(0LL, a[i].y1 - y1); k <= min(y2 - y1, a[i].y2 - y1); ++k) {
                                ans[j][k] = a[i].c;
                            }
                        }
                    }


                    // for (int j = 0; j <= x2 - x1; ++j) {
                    //     for (int k = 0; k <= y2 - y1; ++k) {
                    //         cout << ans[j][k];
                    //     }
                    //     cout << "\n";
                    // }
                    // cout << "\n";

                // }
                // cout << a[i].x1 << " " << a[i].y1 << " " << a[i].x2 << " " << a[i].y2 << "\n";
            }
            for (int j = x2 - x1; j >= 0; --j) {
                for (int k = y2 - y1; k >= 0; --k) {
                    cout << ans[k][j];
                }
                cout << "\n";
            }
        }
    }
    return 0;
}
/*
6
Circle 0 0 5 *
Circle -2 2 1 @
Circle 2 2 1 @
Rectangle 0 -1 0 0 ^
Rectangle -2 -2 2 -2 _
Render -1 0 1 2
*/