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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int N = 10447;
int a[N][N];


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n;
	cin >> n;
	vector<VI> v(N);
	FOR(i, 0, n)
	{
		int x, y;
		cin >> x >> y;
		v[x].PB(y);
	}
	FOR (i, 0, N) sort(ALL(v[i]));
	int m;
	cin >> m;
	FOR (i, 0, m)
	{
		int x, y, r;
		cin >> x >> y >> r;
		FOR (dx, -r, r + 1)
		{
			if (x + dx < 0) continue;
			int d = sqrt(r * r - dx * dx);
			a[x + dx][max(0, y - d)]++;
			a[x + dx][y + d + 1]--;
		}
	}
	int ans = 0;
	FOR(i, 0, N)
	{
		int cnt = 0;
		int k = 0;
		FOR(j, 0, N)
		{
			cnt += a[i][j];
			int c = 0;
			while (k < SZ(v[i]) && v[i][k] == j)
			{
				c++;
				k++;
			}
			if (cnt == 0)
				ans += c;
		}
	}
	cout << ans << '\n';
	
	return 0;
}