#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "(" << p.st << ", " << p.nd << ")";
}

auto operator<<(auto &o, auto x)->decltype(end(x), o) {
    o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
    return o << "}";
}

#ifdef LOCAL
#define deb(x...) cerr << "[" #x << "]: ", [](auto...$) { ((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

const int N=1e3+5;
vector<int> E[N];
bool bip=0;
int col[N];
int ile=0;
void dfs(int v){
    if(col[v]==1)ile++;
    else ile--;
    for(int u:E[v]){
        if(!col[u]){
            col[u]=3-col[v];
            dfs(u);
        }
        else if(col[u]==col[v])bip=0;
    }
}

void solve() {
    int n;
    cin>>n;
    vector<pii> V(n);
    vi r(n);
    for(int i=0; i<n; i++){
        int x, y, ra;
        cin>>x>>y>>ra;
        r[i]=ra;
        V[i]={x, y};
    }
    for(int i=0; i<n; i++){
        for(int j=0; j<i; j++){
            if((r[i]+r[j])*1ll*(r[i]+r[j])==(V[i].st-V[j].st)*1ll*(V[i].st-V[j].st)+(V[i].nd-V[j].nd)*1ll*(V[i].nd-V[j].nd)){
                E[i].pb(j);
                E[j].pb(i);
            }
        }
    }
    bool czy=0;
    for(int i=0; i<n; i++){
        if(!col[i]){
            col[i]=1;ile=0;
            bip=1;
            dfs(i);
            if(bip && ile!=0){
                czy=1;
            }
        }
    }
    if(czy)cout<<"YES\n";
    else cout<<"NO\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    //cin >> tt;
    FOR(te, 0, tt) solve();
    return 0;
}