#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct circle {
	ll x,y,r;
	int ind;
};

bool tangent(circle a, circle b) {
	return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)==(a.r+b.r)*(a.r+b.r);
}

circle a[1001];
vector<int> adj[1001];

int main() {
	int n;
	cin>>n;
	for(int i=0;i<n;++i) {
		cin>>a[i].x>>a[i].y>>a[i].r;
	}
	
	for(int i=0;i<n;++i) {
		for(int j=i+1;j<n;++j) {
			if(tangent(a[i], a[j])) {
				adj[i].push_back(j);
				adj[j].push_back(i);
				//~ cerr<<i<<" "<<j<<"\n"; 
			}
		}
		
	}

	vector<int> vis(n);
	bool ans=false;
	for(int i=0;i<n;++i){
		if(!vis[i]) {

			queue<pair<int,int>> q;
			q.push({i, 1});
			array<int,3> cnt{0,0,0};
			bool paros=true;
			while(!q.empty()) {
				auto& [node, color] = q.front(); q.pop();
				vis[node]=color;
				cnt[color]++;
				//~ cerr<<node<<" "<<color<<"bfs\n";
				for(int j:adj[node]) {
					if(!vis[j]) {
						q.push({j,3-color});
						vis[j]=3-color;
					}else {
						paros&=(3-color)==(vis[j]);
					}
				}
			}
			if(paros) {
				//~ cerr<<i<<" "<<paros<<" "<<cnt[0]<<" "<<cnt[1]<<"\n";
				ans|=cnt[2]!=cnt[1];
			}
		}
	}
	
	cout<<(ans?"YES":"NO")<<"\n";
	
	return 0;
}