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

int n,cnt;
struct point{
    int x,y;
}p[200010],v[200010],q[200010];

bool cmp(point x,point y){
    if (x.x!=y.x) return x.x<y.x;
    return x.y<y.y;
}

bool check(point x,point y,point z){
    point l1,l2;
    l1.x=y.x-x.x;
    l1.y=y.y-x.y;
    l2.x=z.x-y.x;
    l2.y=z.y-y.y;
    if (l1.x*l2.y-l2.x*l1.y>0) return 1;
    return 0;
}

void tb(){
    point p1,p2;
    v[++cnt]=p[1];
    v[++cnt]=p[2];
    for (int i=3;i<=n;i++){
        p1=v[cnt-1];
        p2=v[cnt];
        while(!check(p1,p2,p[i]) && cnt>1){
            cnt--;
            p1=v[cnt-1];
            p2=v[cnt];
        }
        v[++cnt]=p[i];
    }
    int temp=cnt;
    v[++cnt]=p[n-1];
    for (int i=n-2;i>=1;i--){
        p1=v[cnt-1];
        p2=v[cnt];
        while(!check(p1,p2,p[i]) && cnt>temp){
            cnt--;
            p1=v[cnt-1];
            p2=v[cnt];
        }
        v[++cnt]=p[i];
    }
    cnt--; 
}

int main(){
    scanf("%d",&n);
    int m=0;
    for (int i=1;i<=n;i++){
        int x,y;
        scanf("%d %d",&p[i].x,&p[i].y);
        q[i]=p[i];
    }
    sort(p+1,p+1+n,cmp);
    tb();
    int pp=1;
    if (cnt!=n) pp=0;
    else {
	    int p1=1,p2=1;
    	int i=1,j;
	    for (i=1;i<=n;i++) if (q[1].x==v[i].x && q[1].y==v[i].y) break;
	    j=1;
	    while(j<=n){
	    	if (v[i].x!=q[j].x || v[i].y!=q[j].y){
	    		p1=0;
	    		break;
			}
	    	i=i%n+1;
			j=j+1;
		}
		for (i=1;i<=n;i++) if (q[1].x==v[i].x && q[1].y==v[i].y) break;
		j=1;
		while(j<=n){
			if (v[i].x!=q[j].x || v[i].y!=q[j].y){
				printf("%d %d %d %d\n",v[i].x,v[i].y,q[j].x,q[j].y);
	    		p2=0;
	    		break;
			}
	    	i=i-1;
	    	if (i<=0) i+=n; 
			j=j+1;
		}
		pp=p1|p2;
	}
    if (pp) printf("Yes\n");
    else printf("No\n");
}