#include <bits/stdc++.h>
using namespace std;
long long dir(long long x1, long long y1, long long x2, long long y2,
              long long x3, long long y3) {
  long long d = x1 * (y3 - y2) + x2 * (y1 - y3) + x3 * (y2 - y1);
  if (d > 0)
    return -1;
  else if (d == 0)
    return 0;
  else
    return 1;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m;
  vector<pair<long long, long long>> a;
  vector<pair<long long, long long>> b;
  set<pair<long long, long long>> pts;
  vector<pair<long long, long long>> up;
  vector<pair<long long, long long>> down;
  vector<pair<long long, long long>> ans;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    a.push_back(make_pair(x, y));
    pts.insert(make_pair(x, y));
  }
  cin >> m;
  for (long long i = 0; i < m; i++) {
    long long x, y;
    cin >> x >> y;
    b.push_back(make_pair(x, y));
    pts.insert(make_pair(x, y));
  }
  pair<long long, long long> u = *pts.begin();
  pair<long long, long long> v = *(--pts.end());
  for (auto itr = pts.begin(); itr != pts.end(); itr++) {
    long long x = (*itr).first;
    long long y = (*itr).second;
    if (dir(u.first, u.second, x, y, v.first, v.second) <= 0) {
      while (up.size() >= 2 &&
             dir(up[up.size() - 2].first, up[up.size() - 2].second,
                 up[up.size() - 1].first, up[up.size() - 1].second, x,
                 y) == 1) {
        up.pop_back();
      }
      up.push_back(make_pair(x, y));
    }
    if (dir(u.first, u.second, x, y, v.first, v.second) >= 0) {
      while (down.size() >= 2 &&
             dir(down[down.size() - 2].first, down[down.size() - 2].second,
                 down[down.size() - 1].first, down[down.size() - 1].second, x,
                 y) == -1) {
        down.pop_back();
      }
      down.push_back(make_pair(x, y));
    }
  }
  for (long long i = 0; i < up.size(); i++) ans.push_back(up[i]);
  for (long long j = 0; j < down.size(); j++)
    if (down[j] != u && down[j] != v) ans.push_back(down[j]);
  sort(ans.begin(), ans.end());
  long long bl = 0;
  for (long long i = 0; i < m; i++) {
    if (binary_search(ans.begin(), ans.end(), b[i])) {
      bl = 1;
      break;
    }
  }
  if (bl)
    cout << "NO" << endl;
  else
    cout << "YES" << endl;
  return 0;
}
