#include <bits/stdc++.h>
using namespace std;
const int maxn = 200050;
struct point {
  int x, y;
  point(int x = 0, int y = 0) : x(x), y(y) {}
};
bool operator<(point a, point b) {
  return a.y < b.y || (a.y == b.y && a.x < b.x);
}
map<point, bool> mp;
point p[maxn], q[maxn], r[maxn];
point res[maxn];
int n, m;
long long cross(point a, point b, point c) {
  return (long long)(b.x - a.x) * (c.y - a.y) -
         (long long)(b.y - a.y) * (c.x - a.x);
}
int convex(int n) {
  int now = 1;
  for (int i = 1; i <= n; i++) {
    while (now > 2 && cross(res[now - 2], r[i], res[now - 1]) > 0) now--;
    res[now++] = r[i];
  }
  int k = now;
  for (int i = n - 1; i >= 1; i--) {
    while (now > k && cross(res[now - 2], r[i], res[now - 1]) > 0) now--;
    res[now++] = r[i];
  }
  if (n > 1) now--;
  return now - 1;
}
void solve() {
  scanf("%d", &n);
  int tot = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d %d", &p[i].x, &p[i].y);
    r[++tot] = p[i];
    mp[p[i]] = 1;
  }
  scanf("%d", &m);
  int flag = 1;
  for (int i = 1; i <= m; i++) {
    scanf("%d %d", &q[i].x, &q[i].y);
    if (mp.count(q[i])) flag = 0;
    r[++tot] = q[i];
  }
  sort(r + 1, r + tot + 1);
  int now = convex(tot);
  for (int i = 1; i <= now; i++) {
    if (!mp[res[i]]) {
      flag = 0;
      break;
    }
  }
  printf("%s\n", flag ? "YES" : "NO");
}
int main() {
  solve();
  return 0;
}
