//(ᗜ ˰ ᗜ)
// #define NDEBUG
#include <bits/stdc++.h>
using namespace std;
namespace LING
{
#ifdef ONLINE_JUDGE
#define DBG(...) ;
#define dbg(...) ;
#else
#define DBG(x) cout << "! " << #x << " = " << x << endl
#include "debug.h"
#endif
    using ll = long long;
    using db = double;
#define SPO(x) fixed << setprecision(x)
#define FOR(i, l, r) for (ll i = l; i <= (r); ++i)
#define ROF(i, r, l) for (ll i = r; i >= (l); --i)
#define edl '\n'
#define fir first
#define sec second
#define str string
#define pll pair<ll, ll>
#define heap priority_queue
    // constexpr db PI = acos(-1.0);
    // constexpr db EPS = 1.0e-9;
    constexpr long long LNF = 0x3f3f3f3f3f3f3f3fLL;
    constexpr int INF = 0x3f3f3f3f;
    constexpr long long MOD = 998244353;
    constexpr ll MXN = 1e6 + 5;
}
using namespace LING;
ll n, s1, s2;
struct node
{
    ll op;
    ll x, y, r;
    ll a, b, c, d;
    char col;
} v[MXN];
void Solve(void)
{
    cin >> n;
    FOR(i, 1, n)
    {
        str op;
        cin >> op;
        if (op == "Circle")
        {
            v[i].op = 1;
            cin >> v[i].x >> v[i].y >> v[i].r >> v[i].col;
        }
        else if (op == "Rectangle")
        {
            v[i].op = 2;
            cin >> v[i].a >> v[i].b >> v[i].c >> v[i].d >> v[i].col;
        }
        else
        {
            ll xx1, xx2, yy1, yy2;
            cin >> xx1 >> yy1 >> xx2 >> yy2;
            ROF(yy, yy2, yy1)
            {
                ROF(xx, xx2, xx1)
                {
                    bool flag = 0;
                    ROF(j, i - 1, 1)
                    {
                        if (v[j].op == 0)
                            continue;
                        if (v[j].op == 1)
                        {
                            ll tmp = (xx - v[j].x) * (xx - v[j].x) + (yy - v[j].y) * (yy - v[j].y);
                            if (v[j].r * v[j].r >= tmp)
                            {
                                cout << v[j].col;
                                flag = 1;
                                break;
                            }
                        }
                        if (v[j].op == 2)
                        {
                            if (v[j].a <= xx && xx <= v[j].c && v[j].b <= yy && yy <= v[j].d)
                            {
                                cout << v[j].col;
                                flag = 1;
                                break;
                            }
                        }
                    }
                    if (!flag)
                        cout << '.';
                }
                cout << edl;
            }
        }
    }
    return;
}
int main(void)
{
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    // #ifndef ONLINE_JUDGE
    // freopen("cin.txt","r",stdin);
    // freopen("cout.txt","w",stdout);
    // #endif

    int t = 1;
    // cin >> t;
    while (t--)
        Solve();
    return 0;
}