#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#define int long long
using namespace std;
const int INF = 1e9;
const int N = 1e4 + 10;
const double eps = 1e-9;
int n, m;
int a[N];
struct node {
    string s;
    int a, b, c, d;
    char ch;
};
char pt[N][N];
signed main() {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            pt[i][j] = '.';
        }
    }
    int l = 1e9 + 10, r = -1e9 - 10, u = -1e9 - 10, p = 1e9 + 10;
    cin >> n;
    vector<node> v;
    string s, ch;
    int a, b, c, d;
    for (int i = 1; i <= n; i++) {
        cin >> s;
        if (s == "Circle") {
            cin >> a >> b >> c;
            l = min(l, a - c);
            r = max(r, a + c);
            u = max(u, b + c);
            p = min(p, b - c);
            cin >> ch;
            node x;
            x.s = s;
            x.a = a;
            x.b = b;
            x.c = c;
            x.ch = ch[0];
            v.push_back(x);
        } else if (s == "Rectangle") {
            cin >> a >> b >> c >> d;
            l = min({l, a, c});
            r = max({r, a, c});
            u = max({u, b, d});
            p = min({p, b, d});
            cin >> ch;
            node x;
            x.s = s;
            x.a = a;
            x.b = b;
            x.c = c;
            x.d = d;
            x.ch = ch[0];
            v.push_back(x);
        } else {
            cin >> a >> b >> c >> d;
            l = min({l, a, c});
            r = max({r, a, c});
            u = max({u, b, d});
            p = min({p, b, d});
            node x;
            x.s = s;
            x.a = a;
            x.b = b;
            x.c = c;
            x.d = d;
            x.ch = ch[0];
            v.push_back(x);
        }
    }
    for (auto i : v) {
        if (i.s == "Circle") {
            for (int x = i.a - i.c; x <= i.a + i.c; x++) {
                for (int y = i.b - i.c; y <= i.b + i.c; y++) {
                    if ((x - i.a) * (x - i.a) + (y - i.b) * (y - i.b) <= i.c * i.c) {
                        pt[x - l][y - p] = i.ch;
                    }
                }
            }
        } else if (i.s == "Rectangle") {
            for (int x = i.a; x <= i.c; x++) {
                for (int y = i.b; y <= i.d; y++) {
                    pt[x - l][y - p] = i.ch;
                }
            }
        } else {
            for (int y = i.d; y >= i.b; y--) {
                for (int x = i.a; x <= i.c; x++) {
                    cout << pt[x - l][y - p];
                }
                cout << endl;
            }
        }
    }
}

// #include <iostream>
// #include <algorithm>
// #include <vector>
// #include <map>
// #define int long long
// using namespace std;
// const int INF = 1e9;
// const int N = 1e6 + 10;
// int n, m;
// int a[1111],b[1111];
// signed main() {
//     cin>>n;
//     for(int i=1;i<=n;i++) cin>>a[i];
//     for(int i=1;i<=n;i++) cin>>b[i];

// }