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

const long double pi=acosl(-1);
struct Point {
    long long x,y;
    int id;
    long double a2;

    friend bool operator<(Point a,Point b) {
        if(a.x==b.x)return a.y<b.y;
        return a.x<b.x;
    }

    Point(long long x,long long y,int id) {
        this->x=x;
        this->y=y;
        this->a2=atan2l(this->y,this->x);
        this->id=id;
    }
};

struct Line {
    long double A,B,C;

    Line(Point a,Point b) {
        this->A = b.y-a.y;
        this->B = a.x-b.x;
        this->C = a.y*b.x - a.x*b.y;
    }

    int contains(Point x) {
        if(A*x.x + B*x.y+C==0) return 1;
        return 0;
    }
};

struct Vector {
    long double x,y;

    Vector(Point a,Point b) {
        this->x=b.x-a.x;
        this->y=b.y-a.y;
    }
};

int n;
vector<Point> a;

vector<Point> getConvex(vector<Point> a) {
    vector<Point> convex;
    int id=0;
    for(int i=0;i<n;i++) {
        if(a[id].y>a[i].y ||(a[id].y==a[i].y&&a[id].x>a[i].x))id=i;
    }
    swap(a[id],a[0]);
    for(int i=1;i<n;i++) {
        a[i].x-=a[0].x;
        a[i].y-=a[0].y;
        a[i].a2=atan2(a[i].y,a[i].x);
    }

    sort(a.begin(),a.end(),[](Point a,Point b) {
        if(a.a2==b.a2) return a.x<b.x;
        return a.a2<b.a2;
    });

    
    convex.push_back(a[0]);
    for(int i=1;i<n;i++) {
        if(convex.size()<3) {
            convex.push_back(a[i]);
        }
        else {
            while(convex.size()>=3) {
                Vector x(convex[convex.size()-2],convex[convex.size()-1]),
                       y(convex[convex.size()-1],a[i]);

                if(x.x*y.y - x.y*y.x <=0) convex.pop_back();
                else break;
            }
            convex.push_back(a[i]);
        }
    }

    return convex;
}

int check(vector<Point> &a,vector<Point> &convex) {
    queue<Point> A,B;
    for(auto x:a) A.push(x);
    for(auto x:convex) B.push(x);
    if(A.size()!=B.size()) {
        return 0;
    }

    for(int i=0;i<n;i++) {
        if(A.front().id==B.front().id) break;
        A.push(A.front());
        A.pop();
    }

    while(!A.empty()) {
        if(A.front().id==B.front().id) {
            A.pop(),B.pop();
        }
        else {
            return 0;
        }
    }
    return 1;
}
void solve() {
    cin>>n;
    set<Point> st;
    for(int i=1;i<=n;i++) {
        long long x,y;
        cin>>x>>y;
        a.push_back(Point(x,y,i-1));
    }

    for(int i=0;i<n;i++) st.insert(a[i]);
    if(st.size()!=n) {
        return(void)(cout<<"No");
    }

    vector<Point> convex = getConvex(a);
    // for(auto x:convex) cout<<x.id<<endl;

    if(check(a,convex)) return(void)(cout<<"Yes");
    reverse(a.begin(),a.end());
    if(check(a,convex)) return(void)(cout<<"Yes");

    

    cout<<"No";
}

/*
(1,0)
(0,1)
a.x*b.y-a.y*b.x>0 a在b右侧
*/

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    int t=1;
    // cin>>t;
    while(t--)
    solve();
}

/*

*/