#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double LD;
typedef pair <int, int> pii;



const LD PI = acos(-1.0);
#define cp const point &
struct point {
	LL x, y;
	point () {}
	point (LL xx, LL yy) { x = xx, y = yy; }
	point operator + (cp a) const { return {x + a.x, y + a.y}; }
	point operator - (cp a) const { return {x - a.x, y - a.y}; }
	bool operator < (cp a) const {
		return make_pair(x, y) < make_pair(a.x, a.y);
	}
};

LL det (point a, point b) {
	return a.x * b.y - b.x * a.y;
}

void work () {
	int n;
	cin >> n;
	vector <point> a;
	for (int i = 0; i < n; i++) {
		int x, y;
		cin >> x >> y;
		a.push_back({x, y});
	}
	if (det(a[1] - a[0], a[2] - a[0]) < 0) reverse(a.begin(), a.end());
	bool flag = true;
	double ans = 0;
	for (int i = 0; i < n; i++) {
		auto u = a[(i + 2) % n] - a[(i + 1) % n];
		auto v = a[i] - a[(i + 1) % n];
		auto uu = atan2(u.y, u.x);
		auto vv = atan2(v.y, v.x);
		auto d = vv - uu;
		if (d < 0) d += 2 * PI;
		if (abs(PI - d) <= 1e-10) flag = false;
		ans += d;
	}
	puts (flag && abs(ans - (n - 2) * PI) < 0.1 ? "Yes" : "No");
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int T = 1;
	for (int ca = 1; ca <= T; ca ++)
		work();
}