#include <bits/stdc++.h>
using namespace std;

#define qmx(a,b) a<b?b:a
#define qmn(a,b) a>b?b:a
#define int long long
#define fr first
#define se second

string stdop[] = {"Circle", "Rectangle", "Render"};

struct operations{
    int ops;
    int dx1;
    int dy1;
    int dx2;
    int dy2;
    int r;
    char ch;
}tmp;

vector <operations> used_op;

inline bool is_inside(operations op, int ox, int oy){
    if(op.ops == 1){
        int dx = op.dx1 - ox;
        int dy = op.dy1 - oy;
        return dx * dx + dy * dy <= op.r * op.r;
    }else{
        return  ox >= op.dx1 && ox <= op.dx2
            &&  oy >= op.dy1 && oy <= op.dy2;
    }
}

inline int getop(string str){
    for(int i = 0 ; i < 3 ; i++)
        if(str == stdop[i])
            return i;
}

signed main(){
    int n;
    char res;
    cin >> n;
    string str;
    for(int i = 1 ; i <= n ; i++){
        cin >> str;
        tmp.ops = getop(str) + 1;
        switch(tmp.ops){
            case 1:
                cin >> tmp.dx1 >> tmp.dy1 >> tmp.r >> tmp.ch;
                used_op.push_back(tmp);
            break;
            case 2:
                cin >> tmp.dx1 >> tmp.dy1 >> tmp.dx2 >> tmp.dy2 >> tmp.ch;
                used_op.push_back(tmp);
            break;
            default:
                cin >> tmp.dx1 >> tmp.dy1 >> tmp.dx2 >> tmp.dy2;
                for(int i = tmp.dy2 ; i >= tmp.dy1 ; i--){
                    for(int j = tmp.dx2 ; j >= tmp.dx1 ; j--){
                        res = '.';
                        for(auto opij : used_op){
                            if(is_inside(opij, j, i)){
                                res = opij.ch;
                            }
                        }
                        cout << res;
                    }
                    cout << endl;
                }
            break;
        }
    }
    return 0;
}