#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 2100000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = ((int)1e9) - 10;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

const int L = 1296000;
const LD pi = acos(-1.0);
int n, f[N];
int main() {
	IO;
	cin >> n;
	repn(i, 1, n) {
		int x, y, d, a;
		cin >> x >> y >> d >> a;
		d--;
		if (a + d >= L) f[a]++, f[0]++, f[a + d - L + 1]--;
		else f[a]++, f[a + d + 1]--;
	}
	int cur = 0, pos;
	rep(i, 0, L) {
		cur += f[i];
		if (cur == 0) {
			pos = i;
			break;
		}
	}
	LD ang = (LD)pos / (L / 2) * pi, dx = cos(ang), dy = sin(ang), r = 1.0, d = 0;
	int ax, ay, cnt = 0;
	while (1) {
		while (dx * (r + d) < -inf + eps || dx * (r + d) > inf - eps || dy * (r + d) < -inf + eps || dy * (r + d) > inf + eps)  {
			cnt++;
			r /= 2.0;
		}
		d += r;
		ax = (int)(dx * d + 0.1);
		ay = (int)(dy * d + 0.1);
		r *= 2;
		if (cnt > 1000) break;
	}
	cout << "YES\n";
	cout << ax << " " << ay << "\n";
	return 0;
}