#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

struct point
{
	double x;
	double y;
};

struct square
{
	point o;
	point a, b, c, d;

	int is;
}sq[10500];

int n, q, br=0;

bool cross (point &a, point &b, point &c)
{
	return (a.x - c.x) * (b.y - c.y) - (a.y - c.y) * (b.x - c.x) < 0;
}

bool in_tr(point &s, point &a, point &b, point &c)
{

	bool b1, b2, b3;
    b1 = cross(s, a, b);
	b2 = cross(s, b, c);
	b3 = cross(s, c, a);

	return ((b1 == b2) && (b2 == b3));
}


bool inside(point &p, square &s)
{
	return in_tr(p, s.a, s.b, s.c) || in_tr(p, s.a, s.c, s.d);
}

bool inter(square &s, square &t)
{
	return (inside(s.a, t) || inside(s.b, t) || inside(s.d, t) || inside(s.d, t) ||
			inside(t.a, s) || inside(t.b, s) || inside(t.c, s) || inside(t.d, s));
}

void rot(point &p, point &o, double rad)
{
	p.x = cos(rad) * (p.x-o.x) - sin(rad) * (p.y-o.y) + o.x;
	p.y = sin(rad) * (p.x-o.x) + cos(rad) * (p.y-o.y) + o.y;

}

void print()
{
	printf("%d\n", br);
}

void r(int id, double rad)
{
	rot(sq[id].a, sq[id].o, rad);
	rot(sq[id].b, sq[id].o, rad);
	rot(sq[id].c, sq[id].o, rad);
	rot(sq[id].d, sq[id].o, rad);

	br-=sq[id].is;

	sq[id].is = 0;
	for(int i=0; i<n; i++)
		if(i!=id && inter(sq[id], sq[i]))
		{
			sq[id].is ++;
			//printf("inter: %d %d\n", id, i);
		}
	br+=sq[id].is;
}


int main()
{

	freopen("geo.in", "r", stdin);
	freopen("geo.out", "w", stdout);


	scanf("%d", &n);
	for(int i=0; i<n; i++)
	{
		scanf("%lf%lf", &sq[i].o.x, &sq[i].o.y);
	}


	scanf("%d", &q);
	int type, id;
	double rad;
	for(int i=0; i<q; i++)
	{
		scanf("%d", &type);
		if(type==1)
			print();
		else
		{
			scanf("%d%lf", &id, &rad);
			r(id, rad);
		}
	}

	return 0;
}

/*
3
0 0
17 0
35 0
3
1
2 1 0.8
1
*/
/*

*/
<!-- 0.0404s -->