#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

const double eps=1e-10;

struct point{
    double x,y;
    point() {}
    point(double x,double y): x(x), y(y) {}
    point& operator-=(const point &p){
        x -= p.x; y -= p.y;
        return *this;
    }
    point& operator+=(const point &p){
        x += p.x; y += p.y;
        return *this;
    }
    point& operator*=(double d){
        x *= d; y *= d;
        return *this;
    }
    point& operator/=(double d){
        x /= d; y /= d;
        return *this;
    }
    const point operator+ (const point& p) const;
    const point operator- (const point& p) const;
    const point operator* (double d) const;
    const point operator/ (double d) const;
};
const point point::operator+ (const point& p) const{
    point res(*this); return res += p;
}
const point point::operator- (const point& p) const{
    point res(*this); return res -= p;
}
const point point::operator* (double d) const{
    point res(*this); return res *= d;
}
const point point::operator/ (double d) const{
    point res(*this); return res /= d;
}

double abs(point P){
    return sqrt(P.x*P.x+P.y*P.y);
}

double dist(point A,point B){
    return abs(A - B);
}

// 円(AOJ-1183)
struct Circle {
    point p; double r;
    Circle() {}
    Circle(point p, double r): p(p), r(r) {}
};

// 円の交差判定(AOJ-0023)
int isCrossingCircles(Circle a, Circle b){
    double d = dist(a.p, b.p);
    if(d > a.r + b.r + eps) return 0; // AとBは重なっていない
    else if(d < a.r - b.r - eps) return 2; // AがBを内包
    else if(d < b.r - a.r - eps) return -2; // BがAを内包
    else return 1; // 共有点を持つ
}

bool slv(int n, vector<Circle> &c) {
    Circle g;
    g.p = point(0,0);
    g.r = 0;
    // 円に原点が含まれる場合
    for (int i = 0; i < n; ++i) {
        if (isCrossingCircles(c[i], g) >= 1) return true;
    }
    const double pi = acos(-1);
    vector<pair<double,double>> v;
    for (int i = 0; i < n; ++i) {
        auto pq = c[i].r;
        auto op = dist(point(0,0), c[i].p);
        auto oq = sqrt(op*op - pq*pq);

        auto theta = atan2(c[i].p.y, c[i].p.x);
        auto alpha = acos(oq / op);

        v.push_back({theta-alpha, theta+alpha});
        v.push_back({theta-alpha+pi*2, theta+alpha+pi*2});
    }
    sort(v.begin(), v.end());

    for (int i = 0; i < v.size(); ++i) {
        if (v[i].second < -pi) continue;
        if (v[i].first > pi) break;
        if (v[i+1].first - v[i].second > pi) return false;
    }
    return true;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<Circle> c(n);
    for (int i = 0; i < n; ++i) {
        int x,y,r; cin >> x >> y >> r;
        c[i].p = point(x,y);
        c[i].r = r;
    }
    if (slv(n, c)) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
}