/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

struct Point
{
	ll x,y;
	ll b;
};

// Function to calculate the distance from point P to the line through points A and B
double distPointToLine(const Point& P, const Point& A, const Point& B)
{
    // Calculate the coefficients of the line equation Ax + By + C = 0
    double A_coeff = B.y - A.y;
    double B_coeff = A.x - B.x;
    double C_coeff = B.x * A.y - A.x * B.y;

    // Compute the numerator and denominator for the distance formula
    double numerator = std::abs(A_coeff * P.x + B_coeff * P.y + C_coeff);
    double denominator = std::sqrt(A_coeff * A_coeff + B_coeff * B_coeff);

    // Return the distance
    return numerator / denominator;
}

const LD EPS=1e-9;
int solve()
{
	int n;
	if(!(cin>>n))
		return 1;
	vector<Point> po(n);
	for(auto&[x,y,b]:po)cin>>x>>y>>b;
	if(n<=3)
	{
		cout<<"Y\n";
		return 0;
	}
	sort(all(po),[](const Point&p1, const Point& p2) -> bool{
		return p1.b < p2.b;
	});
	FOR(i,0,n-1)
	{
		{
			auto l1=po[i],l2=po[i+1];
			l1.x -= 1e6;
			l1.y -= 1e6;
			l2.x -= 1e6;
			l2.y -= 1e6;
			
			auto cur_po=po;
			sort(all(cur_po),[&](const Point& p1, const Point& p2){
				auto d1=distPointToLine(p1,l1,l2), d2=distPointToLine(p2,l1,l2);
				if(abs(d1-d2) < EPS)
				{
					return p1.b > p2.b;
				}
				return d1 < d2;
			});
			//cout << l1.x-1e6 << ' ' << l1.y-1e6 <<", "<< l2.x-1e6 << " " << l2.y-1e6 << '\n';
			//FOR(j,0,n)
			//{
				//cout << cur_po[j].b << ' ';
			//}
			//cout << '\n';
			bool ok=true;
			FOR(j,0,n-1)
			{
				if(cur_po[j].b < cur_po[j+1].b)
				{
					ok=false;
					break;
				}
			}
			if(ok)
			{
				cout<<"Y\n";
				return 0;
			}
		}
		{
			auto l1=po[i],l2=po[i+1];
			l1.x += 1e6;
			l1.y += 1e6;
			l2.x += 1e6;
			l2.y += 1e6;
			
			auto cur_po=po;
			sort(all(cur_po),[&](const Point& p1, const Point& p2){
				auto d1=distPointToLine(p1,l1,l2), d2=distPointToLine(p2,l1,l2);
				if(abs(d1-d2) < EPS)
				{
					return p1.b > p2.b;
				}
				return d1 < d2;
			});
			//cout << l1.x-1e6 << ' ' << l1.y-1e6 <<", "<< l2.x-1e6 << " " << l2.y-1e6 << '\n';
			//FOR(j,0,n)
			//{
				//cout << cur_po[j].b << ' ';
			//}
			//cout << '\n';
			bool ok=true;
			FOR(j,0,n-1)
			{
				if(cur_po[j].b < cur_po[j+1].b)
				{
					ok=false;
					break;
				}
			}
			if(ok)
			{
				cout<<"Y\n";
				return 0;
			}
		}
	}
	
	cout << "N\n";
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}