#include <bits/stdc++.h>
#define x first
#define y second
#define int long long
using namespace std;
using ld = long double;
typedef pair<int,int> PII;
typedef pair<int,PII>PIII;
typedef long long LL;

const int N = 2e5+10,M=105,mod = 998244353;
const ld pi = acos(-1);
ld normal(ld x)
{
    while(x<0)  x+=2*pi;
    while(x>=2*pi)x-=2*pi;
    return x;
}
void solve()
{
    int n;
    cin>>n;
    bool ok = false;
    vector<ld>nums;
    for(int i=1;i<=n;i++)
    {
        int x,y,r;
        cin>>x>>y>>r;
        if(x*x+y*y<=r*r)    ok=true;
        else
        {
            ld dist = sqrtl(x*x+y*y);
            ld angles = atan2l(y,x),delta=asinl(r/dist);
            nums.push_back(normal(angles-delta));
            nums.push_back(normal(angles+delta));
        }
    }
    if(ok)
    {
        cout<<"Yes\n";
        return;
    }
    if(n==1)
    {
        cout<<"No\n";
        return;
    }
    sort(nums.begin(),nums.end());
    ok = true;
    int m = nums.size();
    for(int i=0;i<nums.size();i++)
        if(normal(nums[(i+1)%m]-nums[i])>pi)
            ok=false;
    if(ok)  cout<<"Yes\n";
    else    cout<<"No\n";
}



signed main()
{
    int T=1;
    cin.tie(0)->sync_with_stdio(false);
    //cin>>T;
    //init();
    while(T--) 
    {
        solve();
    }
    return 0;
}