#include <bits/stdc++.h>
using namespace std;

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;

template <class F>
struct ycr {
	F f;
	
	template <class T>
	explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args>
	decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F>
decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);

	int N; cin >> N;

	const int A = 1296000;
	auto norm = [&](int a) -> int {
		return a % A;
	};

	vector<int> diffs(A+1);

	vector<int> S(N), T(N);
	vector<int> angles = {0, A};
	int sum_covered = 0;
	for (int i = 0; i < N; i++) {
		{
			int x, y; cin >> x >> y;
		}
		int s, t; cin >> s >> t;
		sum_covered += s;
		s += t;
		swap(s, t);
		if (t <= A) {
			diffs[s] += 1;
			diffs[t] -= 1;
		} else {
			diffs[s] += 1;
			diffs[A] -= 1;
			diffs[0] += 1;
			diffs[t] -= 1;
		}
	}
	assert(sum_covered < A);

	int cur = 0;
	for (int a = 0; a < A; a++) {
		cur += diffs[a];
		assert(cur >= 0);
		if (cur == 0) {
			int st = a;
			int en = a+1;
			//cerr << a << ' ' << a+1 << endl;
			double real_ang = 2 * M_PI * (double(st + en) / 2) / A;
			int x = int(1e9 * cos(real_ang));
			int y = int(1e9 * sin(real_ang));
			cout << "YES" << '\n';
			cout << x << ' ' << y << '\n';
			exit(0);
		}
	}
	assert(false);
}