#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x %= p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

void ng(){
	cout<<"NO\n";
	exit(0);
}
using T=tuple<double,double,double>;
void solve()
{	
	vector<T>p(4);
	rep(i,4){
		double x,y,z;
		cin>>x>>y>>z;
		p[i]={x,y,z};
	}
	auto vec=[](T a,T b)->T{
		auto [ax,ay,az]=a;
		auto [bx,by,bz]=b;
		return T{bx-ax,by-ay,bz-az};
	};
	auto norm=[](T a)->double{
		double ret;
		auto [x,y,z]=a;
		ret= pow(x,2)+pow(y,2)+pow(z,2);
		return ret;
	};
	auto inner=[](T a,T b){
		auto [ax,ay,az]=a;
		auto [bx,by,bz]=b;
		return ax*bx+ay*by+az*bz;
	};
	T a=vec(p[0],p[1]),b=vec(p[0],p[2]),c=vec(p[0],p[3]);
	double s_div=norm(a),t_div=norm(a)*norm(b)-pow(inner(a,b),2);
	if(s_div==0||t_div==0)ng();
	double t=norm(a)*inner(b,c)-inner(a,b)*inner(a,c);
	t/=t_div;
	double s=inner(a,c)-inner(a,b)*t;
	s/=s_div;
	if(0<=s&&s<=1&&0<=t&&t<=1&&0<=s+t&&s+t<=1){
		cout<<"YES\n";
	}else{
		ng();
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}