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

int main() {
	int n; cin >> n;
	
	vector<int> lat(n+1), lon(n+1);
	for (int i = 0; i < n; i++) {
		cin >> lat[i] >> lon[i];
	}
	lat[n] = lat[0], lon[n] = lon[0];
	
	bool passes_pole = false;

	int cur_lon = lon[0];
	int min_lon = lon[0];
	int max_lon = lon[0];

	for (int i = 0; i < n; i++) {
		if (lon[i+1] > lon[i]) {
			if (lon[i+1] > lon[i]+180) lon[i+1] -= 360;
		} else {
			if (lon[i+1] < lon[i]-180) lon[i+1] += 360;
		}
		if (abs(lon[i+1]-lon[i]) == 180) passes_pole = true;

		cur_lon += lon[i+1]-lon[i];
		min_lon = min(min_lon, cur_lon);
		max_lon = max(max_lon, cur_lon);
	}

	if (passes_pole || max_lon-min_lon >= 360) {
		cout << "yes" << endl;
	} else {
		cout << "no" << endl;
		while (max_lon >= 180) max_lon -= 360;
		cout << max_lon + 0.5 << endl;
	}
}