#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
#define all(x) begin(x),end(x)
#define rep(i,a,b) for(int i=a;i<b;++i)
#define sz(x) int(x.size())
ll sq(ll a) {
    return a*a;
}
int main() {
    cin.tie(NULL);
    cin.sync_with_stdio(false);
    int n; cin >> n;
    vector<array<int,3>> pts(n);
    for(auto& [x,y,r] : pts) cin >> x >> y >> r;
    typedef array<int,3> C;
    auto good = [&](C a, C b) {
        return sq(a[0]-b[0])+sq(a[1]-b[1]) == sq(a[2]+b[2]);
    };
    vector<bool> vis(n),col(n);
    bool found=0;
    for(int i=0;i<n;++i) if(!vis[i]) {
        bool bad=0;
        int c[2] = {};
        auto dfs = [&](auto&& self, int at) -> void {
            c[col[at]]++;
            vis[at]=1;
            for(int to=0;to<n;++to) if(good(pts[at],pts[to])) {
                if(vis[to]) {
                    if(col[to]==col[at]) {
                        bad=1;
                    }
                } else {
                    col[to] = !col[at];
                    self(self,to);
                }
            }
        };
        dfs(dfs,i);
        if(c[0]!=c[1] and !bad) {
            found=1;
        }
    }
    if(found)
    cout << "YES\n";
    else  cout << "NO\n";
}