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

struct point {
    ll x, y;
    point(ll x=0, ll y=0): x(x), y(y) {}
    point operator-(const point &p) const { return point(x-p.x, y-p.y); }
    point operator*(const ll k) const { return point(k*x, k*y); }
    ll cross(const point &p) const { return x*p.y - p.x*y; }
    bool operator<(const point &p) const { return x < p.x || x == p.x && y < p.y; }
};

bool above(set<point> &hull, point p, ll scale = 1) {
    auto it = hull.lower_bound(point((p.x+scale-1)/scale, p.y/scale));
    if (it == hull.end()) return true;
    if (p.y <= it->y*scale) return false;
    if (it == hull.begin()) return true;
    auto jt = it--;
    point dp = p - *it * scale;
    point dq = *jt - *it;
    if (-dp.y > (1LL<<61)/dq.x) return false;
    return dp.cross(dq) < 0;
}

void add(set<point> &hull, point p) {
    if (!above(hull, p)) return;
    auto pit = hull.insert(p).first;
    while (pit != hull.begin()) {
        auto it = prev(pit);
        if (it->y <= p.y || (it != hull.begin() && (*it-*prev(it)).cross(*pit-*it) >= 0))
            hull.erase(it);
        else
            break;
    }
    auto it = next(pit);
    while (it != hull.end()) {
        if (next(it) != hull.end() && (*it-p).cross(*next(it)-*it) >= 0)
            hull.erase(it++);
        else
            break;
    }
}

int main(void) {
    int n;
    scanf("%d", &n);
    vector<point> points(n);
    for (auto &p: points) scanf("%lld%lld", &p.x, &p.y);
    int e;
    scanf("%d", &e);
    vector<int> quit(n, 0);
    vector<pair<ll, point>> queries(e);
    for (auto &query: queries) {
        char type[10];
        scanf("%s", type);
        if (*type == 'c')
            scanf("%lld%lld%lld", &query.first, &query.second.x, &query.second.y);
        else {
            scanf("%lld", &query.first);
            quit[--query.first] = 1;
            query = make_pair(-1, points[query.first]);
        }
    }
    set<point> hull;
    for (int i = 0; i < n; ++i)
        if (!quit[i]) add(hull, points[i]);
    
    vector<int> ans;
    reverse(queries.begin(), queries.end());
    for (auto &query: queries) {
        if (query.first == -1) add(hull, query.second);
        else ans.push_back(above(hull, query.second, query.first));
    }
    reverse(ans.begin(), ans.end());
    for (auto &a: ans) printf("%s\n", a ? "yes" : "no");
}