#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

vector<ll> visited;
vector<ll> color;

vector<vector<ll>> g;

ll dfs(ll v1){
    visited[v1] = 1;
    color[v1] = 1;
    for(auto v2:g[v1]){
        if (color[v2] != 0){
            color[v1] = -color[v2];
        }
    }
    for(auto v2:g[v1]){
        if (color[v2] == color[v1]){
            return __LONG_LONG_MAX__;
        }
    }
    ll sum = color[v1];
    for(auto v2:g[v1]){
        if (!visited[v2]){
            ll res = dfs(v2);
            if (res == __LONG_LONG_MAX__){
                return __LONG_LONG_MAX__;
            }
            sum += res;
        }
    }
    return sum;
}

int main(){
    ll n;
    cin>>n;
    vector<ll> x(n);
    vector<ll> y(n);
    vector<ll> r(n);
    for(int i=0;i<n;i++){
        cin >> x[i] >>y[i]>>r[i];
    }
    visited = vector<ll>(n,0);
    color = vector<ll>(n,0);
    g = vector<vector<ll>>(n);
    for(int v1=0;v1<n;v1++){
        for(int v2=v1+1;v2<n;v2++){
            if ((x[v1]-x[v2])*(x[v1]-x[v2])+(y[v1]-y[v2])*(y[v1]-y[v2])
            == (r[v1]+r[v2])*(r[v1]+r[v2])){
                g[v1].push_back(v2);
                g[v2].push_back(v1);
            }
        }
    }

    bool possible = 0;
    for(int v=0; v<n; v++){
        if (!visited[v]) {
            ll res = dfs(v);
            if (res != __LONG_LONG_MAX__ && res != 0) {
                possible = 1;
            }
        }
    }
    if(possible){
        cout<<"YES\n";
    }else{
        cout<<"NO\n";
    }
}