#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve();
signed main(){
    cin.sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
    return 0;
}
void solve(){
    int n,a,b,c,d;
    int x1,x2,y1,y2;
    int tx1,tx2,ty1,ty2,r;
    char e,tag;
    string s;
    cin >> n;
    vector<array<int,6>> v;
    for(int i = 1;i <= n;i ++) {
        cin >> s;
        if(s == "Circle") {
            cin >> a >> b >> c >> e;
            v.push_back({0,a,b,c,(int)e,0});
        } else if(s == "Rectangle") {
            cin >> a >> b >> c >> d >> e;
            v.push_back({1,a,b,c,d,(int)e});
        } else {
            cin >> x1 >> y1 >> x2 >> y2;
            vector<vector<char>> out(x2 - x1 + 1,vector<char>(y2 - y1 + 1, '.'));
            for(int x = x1;x <= x2;x ++) {
                for(int y = y1;y <= y2;y ++) {
                    for(auto [id,a,b,c,d,e] : v) {
                        if(id == 0) {
                            tx1 = a,ty1 = b,r = c,tag = (char)d;
                            if((x - tx1)*(x - tx1) + (y - ty1)*(y - ty1) <= r * r) {
                                out[x-x1][y-y1] = tag;
                            }
                        } else {
                            tx1 = a,ty1 = b,tx2 = c,ty2 = d,tag = (char)e;
                            if(x>=tx1&&x<=tx2&&y>=ty1&&y<=ty2){
                                out[x-x1][y-y1] = tag;
                            }
                        }
                    }
                }
            }
            for(int i = x2 - x1;i >= 0;i --) {
                for(int j = y2 - y1;j >= 0;j --) {
                    cout << out[j][i];
                }
                cout << endl;
            }
        }
    }
}