#include<bits/stdc++.h>
using namespace std;
typedef long long db;
struct point
{
	db x,y;
	point operator+(const point &p)const{return {x+p.x,y+p.y};}
	point operator-(const point &p)const{return {x-p.x,y-p.y};}
	db operator*(const point &p)const{return x*p.y-y*p.x;}
	db operator^(const point &p)const{return x*p.x+y*p.y;}
	point turn90()const{return (point){-y,x};}
	db abs2()const{return x*x+y*y;}
	double abs()const{return hypot(x,y);}
	db dis2(const point &p)const{return (*this-p).abs2();}
	double dis(const point &p)const{return (*this-p).abs();}
	bool operator<(const point &p)const{/*int pu=getP(),pv=p.getP();if(pu!=pv)return pu<=pv;*/return *this*p>0;}
	friend istream& operator>>(istream &is,point &p){is>>p.x>>p.y;return is;}
	friend ostream& operator<<(ostream &os,const point &p){os<<p.x<<' '<<p.y;return os;}
};
const double pi=acos(-1.),eps=1e-6;
int main()
{
	ios_base::sync_with_stdio(false);
	int n;
	cin>>n;
	vector<point> a(n+5);
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	double turn=0.;
	for(int i=1;i<=n;i++)
	{
		turn+=atan2((a[i%n+1]-a[i])*(a[(i+1)%n+1]-a[i%n+1]),(a[i%n+1]-a[i])^(a[(i+1)%n+1]-a[i%n+1]));
	}
	if(turn<0)
	{
		turn=-turn;
		reverse(a.begin()+1,a.begin()+n+1);
	}
	if(abs(turn-2*pi)>eps)
	{
		cout<<"No\n";
		return 0;
	}
	for(int i=1;i<=n;i++)
	{
		point pre=a[i],now=a[i%n+1],nxt=a[(i+1)%n+1];
		//(a^2+b^2-c^2)/2ab=cost
		if(acos((pre.dis2(now)+now.dis2(nxt)-pre.dis2(nxt))/(2*pre.dis(now)*now.dis(nxt)))<0)
		{
			cout<<"No\n";
			return 0;
		}
	}
	cout<<"Yes\n";
	return 0;
}