#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define mem(a,b) memset((a),(b),sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
#define int long long
#define db long double

const double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;

struct node {
    int x, y, w;
};

struct point{
    double x, y;
};

int cross(int x1, int y1, int x2, int y2) {
    return (x1*y2-x2*y1);
}

int pointpos(point a) {
    if(a.y == 0 && a.x > 0) return 0;
    if(a.x > 0 && a.y > 0) return 1;
    if(a.x == 0 && a.y > 0) return 2;
    if(a.x < 0 && a.y > 0) return 3;
    if(a.x < 0 && a.y == 0) return 4;
    if(a.x < 0 && a.y < 0) return 5;
    if(a.x == 0 && a.y < 0) return 6;
    return 7;
}

bool compare(point a,point b) {
    int p = pointpos(a);
    int q = pointpos(b);
    if(p == q) {
        if(p == 1 || p == 3) return a.x > b.x;
        else if(p == 5 || p == 7) return a.x < b.x;
    }
    return p < q;
}

void solve() {
    int n;
    vector<node>p;
    cin >> n;
    for(int i = 1; i <= n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        p.push_back({a, b, c});
    }
    vector<point>v;
    
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(i == j) continue;
            if(p[i].w > p[j].w) {
                double a = p[j].x - p[i].x;
                double b = p[j].y - p[i].y;
                a = a / sqrt(a * a + b * b);
                b = b / sqrt(a * a + b * b);
                v.push_back({a, b});
            }
        }
    }
    int flag = 0;
    // for(int i = 0; i < v.size(); i++) {
    //     cout << v[i].x << " " << v[i].y << '\n';  
    // }
    sort(v.begin(), v.end(), compare);
    // for(int i = 0; i < v.size(); i++) {
    //     cout << v[i].x << " " << v[i].y << '\n';
    // }
    if(v.size() <= 2) {
        cout << "Y\n";
        return;
    }
    int m = v.size();
    if(v[0].y >= 0) {
        double xx = -v[0].x, yy = -v[0].y;
        v.push_back((point){xx, yy});
        sort(v.begin(), v.end(), compare);
        if(v[m].x == xx && v[m].y == yy) flag = 1; 
    } else {
        flag = 1;
    }
    if(flag) cout << "Y\n";
    else cout << "N\n";
}

signed main(){
    io;
    int T = 1;
    //cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}