#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> x(n);
    vector<int> y(n);
    for(int i=0;i<n;i++){
        cin>>x.at(i)>>y.at(i);
    }
    bool ans=false;
    int re_up,re_down,im_up,im_down;
    for(int i=0;i<n-2;i++){
        for(int j=i+1;j<n-1;j++){
            for(int k=j+1;k<n;k++){
                re_down=x.at(j)-x.at(i);
                im_down=y.at(j)-y.at(i);
                re_up=x.at(k)-x.at(i);
                im_up=y.at(k)-y.at(i);
                if((re_down*im_up-re_up*im_down) == 0){
                    ans = true;
                    break;
                }
            }
            if(ans){
                break;
            }
        }
        if(ans){
            break;
        }
    }
    if(ans){
        cout << "Yes" <<endl;
    }else{
        cout << "No" <<endl;
    }
    return 0;
}
#include "bits/stdc++.h"
#define ll long long
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FOR(i, a, b) for (int i=a; i<(b); i++)
using namespace std;

bool collinear(int x1, int y1, int x2, int y2, int x3, int y3) {
  return (y1 - y2) * (x1 - x3) == (y1 - y3) * (x1 - x2);
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  
    ll n;
    cin >> n;
    vector<pair<int, int>> v(n);
    F0R(i,n) {
        cin >> v[i].first >> v[i].second;
    }
    F0R(i,n) {
        FOR(j,i+1,n) {
            FOR(k,j+1,n) {
                if(collinear(v[i].first, v[i].second, v[j].first, v[j].second, v[k].first, v[k].second) == true) {
                    cout << "Yes\n";
                    return 0;
                }
            }
        }
    }
    cout << "No\n";

    return 0;
}