#include <bits/stdc++.h>
using namespace std;
struct point {
  long long x, y;
} C[100010];
long long triArea2(const point &a, const point &b, const point &c) {
  return (a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y));
}
bool inConvexPoly(int nc, const point &p) {
  int st = 1, en = nc - 1, mid;
  while (en - st > 1) {
    mid = (st + en) >> 1;
    if (triArea2(C[0], C[mid], p) < 0)
      en = mid;
    else
      st = mid;
  }
  if (triArea2(C[0], C[1], p) == 0) return false;
  if (triArea2(C[0], C[nc - 1], p) == 0) return false;
  if (triArea2(C[st], C[en], p) <= 0) return false;
  return true;
}
int main() {
  int n, T, t = 1, m, i, j, k;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &m);
    C[i].x = m;
    scanf("%d", &m);
    C[i].y = m;
  }
  reverse(C, C + n);
  C[n] = C[0];
  cin >> k;
  bool f = 1;
  point p;
  while (k--) {
    scanf("%d", &m);
    p.x = m;
    scanf("%d", &m);
    p.y = m;
    if (!inConvexPoly(n, p)) {
      f = 0;
      break;
    }
  }
  if (f)
    puts("YES");
  else
    puts("NO");
  return 0;
}
