//Solution by lukasP (Lukáš Poláček)
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <complex>
#include <cassert>
using namespace std;

#define rep(i,a,b) for(__typeof(b) i=a; i<(b); ++i)

typedef complex<double> point;
typedef pair<double, double> pdd;
double vs(const point &a, const point &b) {//vektorovy sucin
    return imag(conj(a)*b);
}
double ss(const point &a, const point &b) {//skalarny sucin
    return real(conj(a)*b);
}
bool priam(point a, point b, point c) {//je bod c na usecke ab?
    return vs(c-a, b-a)==0 && ss(a-c, b-c)<0;
}
bool pret(point a, point b, point c, point d) {//pretinaju sa usecky ab a cd?
    if (priam(a, b, c)) return true;
    if (priam(a, b, d)) return true;
    if (priam(c, d, a)) return true;
    if (priam(c, d, b)) return true;
    return vs(c-a, b-a)*vs(d-a, b-a)<0 && vs(a-c, d-c)*vs(b-c, d-c)<0;
}
double angle(point x, point y) {
    double dif = arg(x) - arg(y);
    if (dif < -M_PI)
        dif += 2 * M_PI;
    if (dif > M_PI)
        dif -= 2 * M_PI;
    return dif;
}
bool inside(point x, vector<point>& a, bool strict = true) {// is x inside a?
    double uh = 0;
    rep(k,0,a.size())
    {
        if (priam(a[k], a[(k + 1) % a.size()], x))
            return !strict;
        uh += angle(a[k] - x, a[(k + 1) % a.size()] - x);
    }

    if (fabs(uh)<6)
        return false;
    return true;
}
int main()
{
    int n; scanf("%d", &n);
    vector<point> a(n);
    rep(i,0,n)
    {
        int x, y;
        scanf("%d %d", &x, &y);
        a[i] = point(x, y);
    }

    // choose the left-most point
    int start = 0;
    rep(i,1,n) if (real(a[i]) < real(a[start]) ||
            (real(a[i]) == real(a[start]) && imag(a[i]) < imag(a[start])) )
        start = i;

    // choose a point that is inside the inner polygon
    int p = (start + 1) % n, q = (start + n - 1) % n;
    point vp = a[p] - a[start], vq = a[q] - a[start];
    vp /= abs(vp); vq /= abs(vq);
    point origin = a[start] + 5e-5 * (vp + vq);

    int m; scanf("%d", &m);
    rep(i,0,m)
    {
        int x, y;
        scanf("%d %d", &x, &y);
        a.push_back(point(x, y));
    }

    double d[n + m][n + m];
    double rot[n + m][n + m];
    rep(i,0,n+m) rep(j,0,i)
    {
        d[i][j] = d[j][i] = abs(a[i] - a[j]);
        rot[i][j] = angle(a[j] - origin, a[i] - origin);
        rot[j][i] = -rot[i][j];

    }
    rep(i,0,n+m) d[i][i] = 1e30;

    vector<point> inner(a.begin(), a.begin() + n), outer(a.begin() + n, a.end());
    rep(i,0,n+m) rep(j,0,i)
    {
        bool ok = true;
        // check intersections with boundaries
        rep(k,0,n+m)
        {
            int l = k + 1;
            if (k < n) l %= n;
            else l = (l - n) % m + n;

            set<int> all = {i, j, k, l};
            if (all.size() == 4 && pret(a[i], a[j], a[k], a[l]))
                ok = false;
        }

        // check if the middle point is on the track
        point mid = (a[i] + a[j]) / 2.;
        if (ok && inside(mid, inner)) ok = false;
        if (ok && !inside(mid, outer, false)) ok = false;

        if (!ok)
            d[i][j] = d[j][i] = 1e30;
    }

    vector<vector<pdd> > dist(n + m);
    dist[start].push_back(pdd(0, 0));
    vector<int> seen(n + m);

    // Djkstra
    rep(iter,0,2*(n+m))
    {
        int mi = -1, mj = -1;
        rep(i,0,n+m) if (seen[i] < (int)dist[i].size())
            if (mi == -1 || dist[i][seen[i]] < dist[mi][mj])
            {
                mi = i;
                mj = seen[i];
            }

        rep(j,0,n+m)
        {
            pdd w = dist[mi][seen[mi]];
            w.first += d[mi][j];
            w.second += rot[mi][j];

            bool update = true;
            for (pdd &o : dist[j])
                if (abs(o.second - w.second) < 1e-6)
                {
                    if (o.first > w.first) o = w;
                    update = false;
                }

            if (update && (dist[j].size() < 2 || dist[j].back().first > w.first))
                dist[j].push_back(w);

            sort(dist[j].begin(), dist[j].end());
            if (dist[j].size() > 2) dist[j].resize(2); // keep the two best paths
        }

        if (++seen[mi] == 2)
            // just a sanity check, never make more than one round around the inner polygon
            assert(abs(abs(dist[mi][0].second - dist[mi][1].second) - M_PI * 2) < 1e-9);
    }

    cout.precision(15);
    cout << dist[0][1].first << endl;
}