#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef double ld;
const ld eps = 1e-9;
struct point {
  ld x, y;
};
point operator+(point a, point b) { return {a.x + b.x, a.y + b.y}; }
point operator-(point a, point b) { return {a.x - b.x, a.y - b.y}; }
ld operator*(point a, point b) { return a.x * b.x + a.y * b.y; }
ld operator/(point a, point b) { return a.x * b.y - a.y * b.x; }
point operator*(ld k, point a) { return {k * a.x, k * a.y}; }

point unit(point a) { return 1 / sqrt(a * a) * a; }
point rotate(point a, ld theta) {
	ld c = cos(theta);
	ld s = sin(theta);
	return {a.x * c - a.y * s, a.x * s + a.y * c};
}

int ccw(point p, point q, point r) {
  ld x = (q - p) / (r - p);
  return (x > eps) - (x < -eps);
}

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	int n;
	cin >> n;

	point a[n]; ld r[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i].x >> a[i].y >> r[i];
		if (a[i] * a[i] <= r[i] * r[i]) {
			return !(cout << "Yes\n");
		}
	}
	vector<point> vec;
	for (int i = 0; i < n; i++) {
		ld theta = asin(r[i] / sqrt(a[i] * a[i]));
		point u = unit(a[i]);
		vec.push_back(rotate(u, theta));
		vec.push_back(rotate(u, -theta));
	}
	auto sgn = [&](point p) {
		return abs(p.y) < eps ? p.x > 0 : p.y > 0;
	};
	sort(vec.begin(), vec.end(), [&](point p, point q) {
		int b = sgn(p);
		int c = sgn(q);
		return b == c ? p / q > 0 : b;
	});

	for (int i = 0; i < vec.size(); i++) {
		int j = (i + 1) % vec.size();
		if (vec[i] / vec[j] < eps) return !(cout << "No\n");
	}
	cout << "Yes\n";
}