#include <bits/stdc++.h>
using namespace std;
struct dot {
  long long x, y;
} a[101000], b;
int n;
int m;
int ans = 0;
string answer;
long long cross(dot d1, dot d2, dot d3) {
  return (d2.x - d1.x) * (d3.y - d1.y) - (d3.x - d1.x) * (d2.y - d1.y);
}
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i].x >> a[i].y;
  }
  cin >> m;
  for (int i = 0; i < m; ++i) {
    cin >> b.x >> b.y;
    int e = 1;
    int v = n - 1;
    int k;
    int r = 1;
    while (e <= v) {
      k = (e + v) / 2;
      if (cross(a[0], b, a[k]) > 0) {
        e = k + 1;
      } else {
        r = k;
        v = k - 1;
      }
    }
    if (r == 1 || cross(a[0], b, a[n - 1]) == 0) continue;
    if (cross(a[r], b, a[r - 1]) < 0) ++ans;
  }
  if (ans == m)
    answer = "YES";
  else
    answer = "NO";
  cout << answer << endl;
  return 0;
}
