#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 1000100;

int n, m, e[maxn], b[maxn], c[maxn], d[maxn], tot, top;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
struct node {
	ldb x, y;
	node(ldb a = 0, ldb b = 0) : x(a), y(b) {}
} a[maxn];

inline node calc(node a, node b, node c) {
	ldb a1 = b.x - a.x, a2 = c.x - a.x, b1 = b.y - a.y, b2 = c.y - a.y;
	ldb c1 = b.x * b.x - a.x * a.x + b.y * b.y - a.y * a.y;
	ldb c2 = c.x * c.x - a.x * a.x + c.y * c.y - a.y * a.y;
	return node((b2 * c1 - b1 * c2) / (b2 * a1 * 2 - b1 * a2 * 2), (a2 * c1 - a1 * c2) / (a2 * b1 * 2 - a1 * b2 * 2));
}

inline ldb dis(node a, node b) {
	return sqrtl((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}

void solve() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d%d", &e[i], &b[i]);
	}
	scanf("%d", &m);
	for (int i = 1; i <= m; ++i) {
		scanf("%d%d", &c[i], &d[i]);
	}
	int tot = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			++tot;
			a[tot] = node(c[j] - e[i], d[j] - b[i]);
		}
	}
	n = tot;
	shuffle(a + 1, a + n + 1, rnd);
	node o = a[1];
	ldb r = 0;
	for (int i = 2; i <= n; ++i) {
		if (dis(o, a[i]) <= r) {
			continue;
		}
		o = a[i];
		r = 0;
		for (int j = 1; j < i; ++j) {
			if (dis(o, a[j]) <= r) {
				continue;
			}
			o = node((a[i].x + a[j].x) / 2, (a[i].y + a[j].y) / 2);
			r = dis(o, a[i]);
			for (int k = 1; k < j; ++k) {
				if (dis(o, a[k]) > r) {
					o = calc(a[i], a[j], a[k]);
					r = dis(o, a[i]);
				}
			}
		}
	}
	printf("%.10Lf %.10Lf %.10Lf\n", r, o.x, o.y);
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}