#include <cstdio>
#include <cmath>
#include <algorithm>

const int maxn = 2e5 + 5;

typedef double ld;

struct Point{
    ld x, y, ang;
    int id;
    Point operator - (const Point &oth) const { return {x - oth.x, y - oth.y}; }
    bool operator == (const Point &oth) const { return x == oth.x && y == oth.y; }
} p[maxn];

ld dis(const Point &a, const Point &b){
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}

ld det(const Point &a, const Point &b){
    return a.x * b.y - a.y * b.x; 
}

int n, sta[maxn], top;

double ans;

bool checkR(int p){
    for(int i = 1; i <= n; i++){
        if(sta[p] ^ i) return false;
        p = p < n ? p+1 : 1;
    }
    return true;
}

bool checkL(int p){
    for(int i = 1; i <= n; i++){
        if(sta[p] ^ i) return false;
        p = p > 1 ? p-1 : n;
    }
    return true;
}

int main(){
    scanf("%d", &n);
    for(int i = 1; i <= n; i++){
        scanf("%lf%lf", &p[i].x, &p[i].y);
        p[i].id = i;
    }
    for(int i = 2; i <= n; i++){
        if(p[i].y < p[1].y || (p[i].y == p[1].y && p[i].x < p[1].x)) std::swap(p[1], p[i]);
    }
    for(int i = 2; i <= n; i++){
        p[i].ang = atan2(p[i].y - p[1].y, p[i].x - p[1].x);
    }
    std::sort(p+2, p+1+n, [&](Point a, Point b){ return a.ang == b.ang ? dis(a, p[1]) < dis(b, p[1]) : a.ang < b.ang; });
    int T = std::unique(p+1, p+1+n) - p - 1; if(T < 3){ puts("No"); return 0; }
    sta[++top] = 1;
    for(int i = 2; i <= n; i++){
        while(top >= 2 && det(p[sta[top]] - p[sta[top-1]], p[i] - p[sta[top]]) < 0){
            top--;
        }
        sta[++top] = i;
    }
    if(top < T){ puts("No"); return 0; }
    for(int i = 1; i <= top; i++) sta[i] = p[sta[i]].id;
    int p = std::find(sta+1, sta+1+T, 1) - sta;
    puts((checkL(p) || checkR(p)) ? "Yes" : "No");
    // auto [mn, mx] = std::minmax_element(sta+1, sta+1+top);
    // printf("%d %d\n", mn-sta, mx-sta);
    // for(int i = 1; i <= top; i++) printf("%d%c", sta[i], " \n"[i==top]);
    return 0;
}