#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
typedef pair<ll, pll> d3;
ll ip(d3 a, d3 b){
  return a.fi*b.fi + a.se.fi*b.se.fi + a.se.se*b.se.se;
}
d3 op(d3 a, d3 b){
  return mp(a.se.fi*b.se.se - a.se.se*b.se.fi, mp(a.se.se*b.fi - a.fi*b.se.se, a.fi*b.se.fi - a.se.fi*b.fi));
}
d3 mi(d3 a, d3 b){
  return mp(a.fi-b.fi, mp(a.se.fi-b.se.fi, a.se.se-b.se.se));
}
d3 p[4], n, d[3];
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  FOR(i, 0, 4) cin >> p[i].fi >> p[i].se.fi >> p[i].se.se;
  FOR(i, 0, 3) d[i] = mi(p[i], p[(i+1)%3]);
  n = op(d[0], d[1]);
  ll s[3];
  FOR(i, 0, 3) s[i] = ip(n, op(d[i], mi(p[3], p[(i+1)%3])));
  cout << ((s[0]*s[1] >= 0 && s[1]*s[2] >= 0) ? "YES" : "NO") << endl;
  return 0;
}