#include<bits/stdc++.h>
using namespace std;
int n,x[1010],y[1010],p[1010];
struct no{
	int x,y,hf;
	no(){}
	no(int x_,int y_){x=x_,y=y_,hf=(x>0)||(x==0&&y>0);}
	inline int cro(no a){return x*a.y-y*a.x;}
}a[1001000];
int m;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d%d%d",&x[i],&y[i],&p[i]);
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(p[i]>p[j])
	a[++m]=no(x[j]-x[i],y[j]-y[i]);
	sort(a+1,a+m+1,[&](no a,no b){if(a.hf!=b.hf)return a.hf<b.hf;return a.cro(b)>0;});
	for(int i=1;i<=m;i++)if(a[i].cro(a[i%m+1])<=0){
		puts("Y");return 0;
	}
	return puts("N"),0;
}