#include <bits/stdc++.h>
using namespace std;
template <class T>
void CIN(T &a) {
  cin >> a;
}
template <class T>
void CIN(T &a, T &b) {
  cin >> a >> b;
}
template <class T>
void CIN(T &a, T &b, T &c) {
  cin >> a >> b >> c;
}
template <class T>
void CIN(T &a, T &b, T &c, T &d) {
  cin >> a >> b >> c >> d;
}
template <class T>
void PI(T a) {
  cout << a << endl;
}
template <class T>
void PI(T a, T b) {
  cout << a << " " << b << endl;
}
template <class T>
void PIS(T a) {
  cout << a << " ";
}
template <class T>
T abs(T a) {
  return a < 0 ? -a : a;
}
const int N = 100010;
const double inf = 1e18;
int n, m;
struct pos {
  double x, y;
  pos() {}
  pos(double x, double y) : x(x), y(y) {}
} e[N], d[N];
double f(double k, double a, double b, double c) {
  return a * k * k + b * k + c;
}
double cross(pos a, pos b, pos c) {
  return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
}
bool judge(pos z) {
  double t = cross(z, d[0], d[1]);
  int i;
  for (i = 0; i < (int)(m); ++i) {
    if (t * cross(z, d[i], d[(i + 1) % m]) <= 0) return false;
  }
  return true;
}
int main() {
  int i;
  cin >> n;
  for (i = 0; i < (int)(n); ++i) scanf("%lf%lf", &e[i].x, &e[i].y);
  cin >> m;
  for (i = 0; i < (int)(m); ++i) scanf("%lf%lf", &d[i].x, &d[i].y);
  double sumx = 0, sumy = 0, ssx = 0, ssy = 0;
  for (i = 0; i < (int)(n); ++i) {
    sumx += e[i].x;
    ssx += e[i].x * e[i].x;
    sumy += e[i].y;
    ssy += e[i].y * e[i].y;
  }
  double ansx = sumx / n, ansy = sumy / n;
  double ans = ssx - sumx * sumx / n + ssy - sumy * sumy / n;
  if (judge(pos(ansx, ansy)))
    PI(ans);
  else {
    double fans = inf;
    for (i = 0; i < (int)(m); ++i) {
      int cx = i, nx = (i + 1) % m;
      double p1 = d[nx].x - d[cx].x;
      double p2 = d[nx].y - d[cx].y;
      double b1 = d[cx].x - ansx;
      double b2 = d[cx].y - ansy;
      double a = p1 * p1 + p2 * p2;
      double b = (p1 * b1 + p2 * b2) * 2;
      double c = b1 * b1 + b2 * b2;
      double k = -b / 2 / a;
      if (0 <= k && k <= 1)
        fans = min(fans, f(k, a, b, c) * n + ans);
      else {
        fans = min(fans, min(f(0, a, b, c) * n + ans, f(1, a, b, c) * n) + ans);
      }
    }
    PI(fans);
  }
  return 0;
}
