#include <bits/stdc++.h>
using namespace std;
struct Point {
  double x, y;
  int z;
  Point() {}
  Point(double a, double b, int c) {
    x = a;
    y = b;
    z = c;
  }
};
Point operator-(const Point &a, const Point &b) {
  return Point(a.x - b.x, a.y - b.y, 0);
}
bool operator==(const Point &a, const Point &b) {
  return fabs(a.x - b.x) < 1e-8 && fabs(a.y - b.y) < 1e-8;
}
bool operator!=(const Point &a, const Point &b) { return !(a == b); }
bool operator<(const Point &a, const Point &b) {
  if (a.x != b.x) return a.x < b.x;
  return a.y < b.y;
}
double cross(const Point &A, const Point &B) { return A.x * B.y - A.y * B.x; }
double area(const Point &A, const Point &B, const Point &C) {
  return cross(B - A, C - A);
}
bool validate(const Point &A, const Point &B, const Point &C) {
  return cross(Point(B.x - A.x, B.y - A.y, 0),
               Point(C.x - A.x, C.y - A.y, 0)) >= 0;
}
vector<Point> ConvexHull(vector<Point> P) {
  sort(P.begin(), P.end());
  int n = P.size(), k = 0;
  Point *H = new Point[2 * n];
  for (int i = 0; i < n; ++i) {
    while (k >= 2 && !validate(H[k - 2], H[k - 1], P[i])) --k;
    H[k++] = P[i];
  }
  for (int i = n - 2, t = k; i >= 0; --i) {
    while (k > t && !validate(H[k - 2], H[k - 1], P[i])) --k;
    H[k++] = P[i];
  }
  return vector<Point>(H, H + k - 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  vector<Point> v;
  int n, x, y, m;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> x >> y;
    v.push_back(Point(x, y, 0));
  }
  cin >> m;
  for (int i = 0; i < m; ++i) {
    cin >> x >> y;
    v.push_back(Point(x, y, 1));
  }
  int ans = 0;
  vector<Point> tmp = ConvexHull(v);
  for (int i = 0; i < (int)tmp.size(); ++i) {
    ans += tmp[i].z;
  }
  if (ans)
    cout << "NO";
  else
    cout << "YES";
  return 0;
}
