#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define bs bitset < N >
using namespace std;
const int N = 1e6 + 7;
const double pi = acos(-1);
int n, m;

double x[N], y[N], r[N];
vector < double > point;

inline void pb(double x) {
//	cout << "x = " << x << endl;
	while(x < 0) x += pi * 2;
	while(x >= pi * 2) x -= pi * 2;
	point.emplace_back(x);
}

void solve(double x, double y, double r) {
	double rotate = atan2(x, y);
	double nx = x * cos(rotate) - y * sin(rotate);
	double ny = x * sin(rotate) + y * cos(rotate);
	x = nx;
	y = ny;
//	cout << r << ' ' << ny << endl;
	double t = cos(r / ny);
	pb(rotate - t);
	pb(rotate + t);
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 1, n) {
		cin >> x[i] >> y[i] >> r[i];
		if(x[i] * x[i] + y[i] * y[i] <= r[i] * r[i]) {
			cout << "Yes\n";
			return 0;
		} 
		solve(x[i], y[i], r[i]);
	}
	sort(point.begin(), point.end());
	L(i, 0, sz(point) - 2) {
		if(point[i + 1] - point[i] > pi) {
			cout << "No\n";
			return 0;
		}
	}
	if(point.back() - point[0] < pi) {
		cout << "No\n";
	} else {
		cout << "Yes\n";
	}
	return 0;
}