#include <bits/stdc++.h>
#define qqbb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define int long long
#define endl '\n'
#define lb(x) x & -x
#define AA cerr<<"AA"<<endl;
using namespace std;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f;

const int N = 2e5 + 10, M = 4e5 + 10;

void solve(){
    int n;cin>>n;
    vector<array<char,2>> op(n+1);
    vector<array<int,4>> opp(n+1);
    int lo=inf,le=inf;
    int lo1=inf,le1=inf;
    int hi1=-inf,ri1=-inf;
    for(int i=1;i<=n;i++){
        string s;cin>>s;
        if(s == "Circle"){
            int x,y,r;cin>>x>>y>>r;
            char p;cin>>p;
            op[i][0] = 'A';
            op[i][1] = p;
            opp[i][0]=x;
            opp[i][1]=y;
            opp[i][2]=r;
            opp[i][3]=0;
        }
        else if(s == "Rectangle"){
            int x1,y1,x2,y2;cin>>x1>>y1>>x2>>y2;
            char p;cin>>p;
            op[i][0] = 'B';
            op[i][1] = p;
            opp[i][0]=x1;
            opp[i][1]=y1;
            opp[i][2]=x2;
            opp[i][3]=y2;
        }
        else{
            int x1,y1,x2,y2;cin>>x1>>y1>>x2>>y2;
            lo1=min(lo1,y1);
            le1=min(le1,x1);
            hi1=max(hi1,y2);
            ri1=max(ri1,x2);
            op[i][0] = 'C';
            op[i][1] = '.';
            opp[i][0]=x1;
            opp[i][1]=y1;
            opp[i][2]=x2;
            opp[i][3]=y2;
        }
    }
    vector<vector<char>> mp(ri1 - le1 + 1,vector<char> (hi1 - lo1 + 1));
    int mpx = ri1 - le1 + 1;
    int mpy = hi1 - lo1 + 1;
    for(int i=0;i<mpx;i++){
        for(int j=0;j<mpy;j++){
            mp[i][j] = '.';
        }
    }
    for(int i=1;i<=n;i++){
        if(op[i][0] == 'A'){
            int u=opp[i][0]-le1;
            int v=opp[i][1]-lo1;
            int r=opp[i][2];
            for(int x=max(0ll,u-r);x<=min(mpx-1,u+r);x++){
                for(int y=max(0ll,v-r);y<=min(mpy-1,v+r);y++){
                    if((x-u)*(x-u) + (y-v)*(y-v) <= r*r){
                        mp[x][y] = op[i][1];
                    }
                }
            }
        }
        else if(op[i][0] == 'B'){
            int x1=opp[i][0]-le1;
            int y1=opp[i][1]-lo1;
            int x2=opp[i][2]-le1;
            int y2=opp[i][3]-lo1;
            for(int x=max(0ll,x1);x<=min(mpx-1,x2);x++){
                for(int y=max(0ll,y1);y<=min(mpy-1,y2);y++){
                    mp[x][y] = op[i][1];
                }
            }
        }
        else{
            int x1=opp[i][0]-le1;
            int y1=opp[i][1]-lo1;
            int x2=opp[i][2]-le1;
            int y2=opp[i][3]-lo1;
            for(int y=y2;y>=y1;y--){
                for(int x=x1;x<=x2;x++){
                    cout<<mp[x][y];
                }
                cout<<endl;
            }
        }
    }
}

signed main(){
    qqbb;
//	cout<<fixed<<setprecision(0);
    int Test=1;
//	cin>>Test;
    while(Test--){
        solve();
    }
    return 0;
}