#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int n;
vector<pii> v;

bool check(int idx, vector<int>& u)
{
    if (u.size() == 3)
    {
        int dx1 = v[u[0]].first-v[u[1]].first, dy1 = v[u[0]].second-v[u[1]].second;
        int dx2 = v[u[1]].first-v[u[2]].first, dy2 = v[u[1]].second-v[u[2]].second;

        if (!dx1 && !dx2) return true;
        if (!dy1 && !dy2) return true;
        if (dy1*dx2 == dy2*dx1) return true;

        return false;
    }
    /////////////////////////////////////////////////////
    bool ret = false;
    for (int i = idx+1; i < n; i++)
    {
        u.push_back(i);
        ret = (ret || check(i, u));
        u.pop_back();

        if (ret) break;
    }
    return ret;
}
int main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;
    v.resize(n); for (pii& p : v) cin >> p.first >> p.second;
    
    vector<int> temp;
    cout << (check(-1, temp) ? "Yes" : "No") << endl;
    return 0;
}

#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define print(x) cout << x << "\n"
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))

typedef long long ll;

using namespace std;
using vl = vector<ll>;
using Graph = vector<vector<int> >;

int main() {
    int n; cin >> n;
    vector<int> x(n);
    vector<int> y(n);
    rep(i,n) cin >> x[i] >> y[i];
    bool ans =false;
    rep(i,n-2){
        for(int j=i+1;j<n-1;j++){
            for(int k=j+1;k<n;k++){
                int x1=x[i]; int y1=y[i];
                int x2=x[j]; int y2=y[j];
                int x3=x[k]; int y3=y[k];
                int k1,k2;
                k1 = (y2-y1)*(x3-x1);
                k2 = (y3-y1)*(x2-x1);
                if(k1==k2) ans = true;
            }
        }
    }
    if(ans) cout << "Yes" << endl;
    else cout << "No" << endl;
}