#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const double EPS=0.00000001;
struct Point{
	int x;
	double y;
	int type;
	Point(const int &x,const double &y,const int &type){
		this->x=x;
		this->y=y;
		this->type=type;
	}
	Point(){}
}p[405*20005+100005];
bool cmp(const Point &a,const Point &b){
	return a.x!=b.x ? a.x<b.x : (fabs(a.y-b.y)>=EPS ? a.y>b.y : a.type<b.type);
}
double sqr(double x){
	return x*x;
}
int n,m,e;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d%lf",&p[i].x,&p[i].y);
		p[i].type=1;
	}
	e=n;
	int x;
	double y,r;
	scanf("%d",&m);
	for(int i=1;i<=m;++i){
		scanf("%d%lf%lf",&x,&y,&r);
		for(int j=x-r;j<=x+r;++j){
			double tmp=r*r-sqr(x-(double)j);
			p[++e]=Point(j,sqrt(tmp)+y,0);
			p[++e]=Point(j,-sqrt(tmp)+y,2);
		}
	}
	sort(p+1,p+e+1,cmp);
	int in=0,ans=0;
	for(int i=1;i<=e;++i){
		if(p[i].type==0){
			++in;
		}
		else if(p[i].type==2){
			--in;
		}
		else{
			if(in==0){
				++ans;
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}