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

int gcd(int a, int b) {
            if (a == 0) return b;
            if (b == 0) return a;
            if (a < 0) return gcd(-1 * a, b);
            if (b < 0) return gcd(a, -1 * b);
            if (a > b) return gcd(b, a);
            return gcd(b%a, a);
        }

int solve(vector<int> &X, vector<int> &Y) {

    map<pair<int, int>, int> M;
    int ans = 0;

    for (int i = 0; i < X.size(); i++) {

        M.clear();
        int same = 1, curMax = 0;
        for (int j = i + 1; j < X.size(); j++) {

            int xdiff = X[i] - X[j];
            int ydiff = Y[i] - Y[j];
            if (xdiff == 0 && ydiff == 0) {
                // Same points
                same ++;
                continue;
            }

            if (xdiff < 0) {
                xdiff *= -1;
                ydiff *= -1;
            }

            int g = gcd(xdiff, ydiff);
            M[make_pair(xdiff / g, ydiff / g)]++;
            curMax = max(curMax, M[make_pair(xdiff / g, ydiff / g)]);
        }

        curMax+=same;
        ans = max(ans, curMax);
    }
    return ans;
}

int main() {

    vector<int> X;
    vector<int> Y;
    int n,x,y;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>x>>y;
        X.push_back(x);
        Y.push_back(y);

    }
    int z=solve(X, Y) ;
   // cout<<z<<endl;
    if(z==n) cout<<"YES"<<endl;
    else     cout<<"NO"<<endl;
    return 0;
}