#include <bits/stdc++.h>
using namespace std;
template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
const double EPS = 1e-9;
bool eq0(double x) { return abs(x) < EPS; }
bool gt0(double x) { return x > -EPS; }
bool lt0(double x) { return x < EPS; }
struct PT {
  double x, y;
  PT(double x = 0, double y = 0) : x(x), y(y) {}
  PT operator+(const PT& o) const { return PT(x + o.x, y + o.y); }
  PT operator-(const PT& o) const { return PT(x - o.x, y - o.y); }
  PT operator*(double t) const { return PT(x * t, y * t); }
  double operator*(const PT& o) const { return x * o.x + y * o.y; }
  double operator%(const PT& o) const { return x * o.y - y * o.x; }
  bool operator<(const PT& o) const { return eq0(x - o.x) ? y < o.y : x < o.x; }
  bool operator==(const PT& o) const { return eq0(x - o.x) && eq0(y - o.y); }
};
template <class F>
int search(int l, int r, F test) {
  while (l < r) {
    int m = l + r >> 1;
    if (test(m))
      r = m;
    else
      l = m + 1;
  }
  return test(l) ? l : l + 1;
}
struct Polygon {
  int sides;
  vector<PT> p;
  Polygon(vector<PT>&& v) : sides(v.size()), p(v) { p.push_back(p.front()); }
  int contains(const PT& q) {
    PT u = q - p[0], v = p[sides - 1] - p[0];
    if (gt0((p[1] - p[0]) % u) && gt0(u % v)) {
      int i =
          search(1, sides - 1, [&](int i) { return gt0(u % (p[i] - p[0])); });
      long long c = (p[i] - p[i - 1]) % (q - p[i - 1]);
      if (c < 0)
        return 0;
      else if (eq0(c))
        return 1;
      else
        return eq0(u % v) ? 1 : 2;
    } else {
      return 0;
    }
  }
};
int main() {
  int n;
  scanf("%d", &n);
  vector<PT> u;
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    u.emplace_back(x, y);
  }
  reverse(u.begin(), u.end());
  Polygon pol(move(u));
  int m;
  scanf("%d", &m);
  vector<PT> v;
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    v.emplace_back(x, y);
  }
  bool all = true;
  for (PT& p : v) {
    all &= pol.contains(p) == 2;
  }
  if (all)
    printf("YES\n");
  else
    printf("NO\n");
}
