#include <bits/stdc++.h>

using namespace std;

struct point {
  double x, y, z;
  point(double x, double y, double z): x(x), y(y), z(z) {}
  point(): x(0), y(0), z(0) {}
};

point operator-(const point& a, const point& b) {
  return point(a.x - b.x, a.y - b.y, a.z - b.z);
}

point operator*(double k, const point& p) {
  return point(k * p.x, k * p.y, k * p.z);
}

double dot(point a, point b) {
  return a.x * b.x + a.y * b.y + a.z * b.z;
}

point cross(point a, point b) {
  return point(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z, a.x * b.y - a.y * b.x);
}

double norm(point p) {
  return sqrt(dot(p, p));
}

// pから三角形abcに延ばした垂線の足の座標
point calc(point a, point b, point c, point p) {
  point n = cross(b - a, c - a);
  double len = dot(p - a, n) / norm(n);
  return p - len / norm(n) * n;
}

// pが三角形abcの内部にあるか？
bool check(point a, point b, point c, point p) {
  vector<point> tri{a, b, c};

  vector<point> products;
  for (int i = 0; i < tri.size(); i++) {
    products.push_back(cross(tri[(i+1) % tri.size()] - tri[i], p - tri[i]));
  }

  for (int i = 0; i < products.size(); i++) {
    if (dot(products[0], products[i]) < 0)
      return false;
  }
  
  return true;
}


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  point a, b, c, p;
  cin >> a.x >> a.y >> a.z;
  cin >> b.x >> b.y >> b.z;
  cin >> c.x >> c.y >> c.z;
  cin >> p.x >> p.y >> p.z;

  point h = calc(a, b, c, p);
  if (check(a, b, c, h))
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  
  return 0;
}