#include<bits/stdc++.h>

using namespace std;

const int N = ;

int c, tot, cnt, top, ask;

int fa[N], l[N], r[N], d[N], mark[N];

bool ans[N];

struct dsu {

    int u, v, fa, du, dv;

    dsu(int u = , int v = , int fa = , int du = , int dv = ) : u(u), v(v), fa(fa), du(du), dv(dv) {}

} st[N];

pair<int, int> operation[N];

map<pair<int, int>, int> mp;

vector<pair<int, int> > tree[N << ], q[N << ];

char opt[];

inline int read()

{

    int x = , f = ; char c = getchar();

    while(c < '' || c > '') { if(c == '-') f = -; c = getchar(); }

    while(c >= '' && c <= '') { x = x *  + c - ''; c = getchar(); }

    return x * f;

}

int find(int x)

{

    return x == fa[x] ? x : find(fa[x]);

}

int id(int x, int y)

{

    return (x - ) * c + y;

}

void unite(pair<int, int> o)

{

    int x = find(o.first), y = find(o.second);

    if(d[x] > d[y]) swap(x, y);

    st[++top] = dsu(x, y, fa[x], d[x], d[y]);

    if(x != y)

    {

        d[y] += d[x];

        fa[x] = y;

    }

}

void del(int now)

{

    while(top != now)

    {

        dsu x = st[top];

        fa[x.u] = x.fa;

        d[x.u] = x.du;

        d[x.v] = x.dv;

        --top;

    }

}

void update(int l, int r, int x, int a, int b, pair<int, int> o)

{

    if(l > b || r < a) return;

    if(l >= a && r <= b)

    {

        tree[x].push_back(o);

        return;

    }

    int mid = (l + r) >> ;

    update(l, mid, x << , a, b, o);

    update(mid + , r, x <<  | , a, b, o);

}

void dfs(int l, int r, int x)

{

    int now = top;

    for(int i = ; i < tree[x].size(); ++i) unite(tree[x][i]);

    if(l == r)

    {

        for(int i = ; i < q[l].size(); ++i)

        {

            pair<int, int> o = q[l][i];

            if(find(o.first) == find(o.second)) puts("Y");

            else puts("N");

        }

        del(now);

        return;

    }

    int mid = (l + r) >> ;

    dfs(l, mid, x << );

    dfs(mid + , r, x <<  | );

    del(now);

}

int main()

{

//    freopen("bzoj_1018.in", "r", stdin);

//    freopen("bzoj_1018.out", "w", stdout);

    memset(l, 0x3f3f, sizeof(l));

    c = read();

    for(int i = ; i <=  * c; ++i)

    {

        fa[i] = i;

        d[i] = ;

    }

    while(scanf("%s", opt))

    {

        if(opt[] == 'E') break;

        ++tot;

        int r1 = read(), c1 = read(), r2 = read(), c2 = read(), u = id(r1, c1), v = id(r2, c2);

        if(u > v) swap(u, v);

        if(opt[] == 'O')

        {

            if(mp.find(make_pair(u, v)) != mp.end()) continue;

            l[++cnt] = tot;

            operation[cnt] = make_pair(u, v);

            mp[make_pair(u, v)] = cnt;

        }

        if(opt[] == 'C')

        {

            if(mp.find(make_pair(u, v)) == mp.end()) continue;

            r[mp[make_pair(u, v)]] = tot - ;

            mp.erase(make_pair(u, v));

        }

        if(opt[] == 'A') q[tot].push_back(make_pair(u, v));

    }

    for(int i = ; i <= cnt; ++i)

    {

        if(!r[i]) r[i] = tot;

        update(, tot, , l[i], r[i], operation[i]);

    }

    dfs(, tot, );

    for(int i = ; i <= ask; ++i) if(ans[i]) puts("Y");

    else puts("N");

//    fclose(stdin);

//    fclose(stdout);

    return ;

}