#include <bits/stdc++.h>
using namespace std;
int N = 100001;
struct Point {
  long long x, y;
};
long long pro(Point f, Point s, Point t) {
  return (s.x - f.x) * (t.y - f.y) - (t.x - f.x) * (s.y - f.y);
}
int main() {
  int n, m;
  Point a[N];
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y;
  cin >> m;
  for (int i = 1; i <= m; i++) {
    Point b;
    cin >> b.x >> b.y;
    if (pro(a[1], a[2], b) >= 0 || pro(a[1], a[n], b) <= 0) {
      cout << "NO" << endl;
      ;
      return 0;
    }
    int l = 2;
    int r = n;
    while (l < r) {
      int mid = (l + r) / 2;
      if (pro(a[1], a[mid], b) >= 0)
        r = mid;
      else
        l = mid + 1;
    }
    if (pro(a[l], a[l - 1], b) <= 0) {
      cout << "NO" << endl;
      ;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}
