#include <bits/stdc++.h>
using namespace std;
vector<string> split(const string &s, char c) {
  vector<string> v;
  stringstream ss(s);
  string x;
  while (getline(ss, x, c)) v.push_back(x);
  return v;
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
  cerr << "[DEBUG] " << it->substr((*it)[0] == ' ', it->length()) << " = " << a
       << '\n';
  err(++it, args...);
}
const int MOD = 1000000007;
template <class T, class U>
inline T tmin(T a, U b) {
  return (a < b) ? a : b;
}
template <class T, class U>
inline T tmax(T a, U b) {
  return (a > b) ? a : b;
}
template <class T, class U>
inline void amax(T &a, U b) {
  if (b > a) a = b;
}
template <class T, class U>
inline void amin(T &a, U b) {
  if (b < a) a = b;
}
template <class T>
T gcd(T a, T b) {
  while (b != 0) {
    T c = a;
    a = b;
    b = c % b;
  }
  return a;
}
const int N = 8, INF = 1e9;
bool inside(int x, int y, const vector<int> &s) {
  int xm[2] = {INF, -INF}, ym[2] = {INF, -INF};
  for (int i = 0; i + 1 < N; i += 2) {
    int nx = s[i] - s[i + 1];
    int ny = s[i] + s[i + 1];
    amin(xm[0], nx);
    amax(xm[1], nx);
    amin(ym[0], ny);
    amax(ym[1], ny);
  }
  int nx = x - y, ny = x + y;
  return (nx >= xm[0] && nx <= xm[1] && ny >= ym[0] && ny <= ym[1]);
}
bool check(vector<int> &s1, vector<int> &s2) {
  int xm[2] = {INF, -INF}, ym[2] = {INF, -INF};
  for (int i = 0; i + 1 < N; i += 2) {
    amin(xm[0], s1[i]);
    amax(xm[1], s1[i]);
    amin(ym[0], s1[i + 1]);
    amax(ym[1], s1[i + 1]);
  }
  for (int x = (xm[0]); x < (xm[1] + 1); ++x)
    for (int y = (ym[0]); y < (ym[1] + 1); ++y) {
      if (inside(x, y, s2)) return true;
    }
  for (int i = 0; i + 1 < N; i += 2) {
    int nx = s1[i] - s1[i + 1];
    int ny = s1[i] + s1[i + 1];
    s1[i] = nx, s1[i + 1] = ny;
    nx = s2[i] - s2[i + 1];
    ny = s2[i] + s2[i + 1];
    s2[i] = nx, s2[i + 1] = ny;
  }
  int nxm[2] = {INF, -INF}, nym[2] = {INF, -INF};
  for (int i = 0; i + 1 < N; i += 2) {
    amin(nxm[0], s2[i]);
    amax(nxm[1], s2[i]);
    amin(nym[0], s2[i + 1]);
    amax(nym[1], s2[i + 1]);
  }
  for (int x = (nxm[0]); x < (nxm[1] + 1); ++x)
    for (int y = (nym[0]); y < (nym[1] + 1); ++y) {
      if (inside(x, y, s1)) return true;
    }
  return false;
}
int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(false);
  vector<int> s1(N), s2(N);
  for (int i = (0); i < (N); ++i) cin >> s1[i];
  for (int i = (0); i < (N); ++i) cin >> s2[i];
  puts(check(s1, s2) ? "Yes" : "No");
  return 0;
}
