// < Rahil Malhotra / ViciousCoder >
#include "bits/stdc++.h"
using namespace std;
 
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define double long double

int32_t main() 
{
    IOS;
    int n;
    cin>>n;
    int arr[n][2];
    for(int i=0;i<n;i++)
        cin>>arr[i][0]>>arr[i][1];
    int fl=0;
    for(int i=0;i<n;i++)
        for(int j=i+1;j<n;j++)
            for(int k=j+1;k<n;k++)
            {
                int a=arr[i][0]*(arr[j][1]-arr[k][1]);
                a+=arr[j][0]*(arr[k][1]-arr[i][1]);
                a+=arr[k][0]*(arr[i][1]-arr[j][1]);
                if(a==0)
                    fl=1;
            }
    if(fl)
        print("Yes");
    else
        print("No");
} 
//always use
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i=0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long ll;
#define MOD 1000000007
#define HASHMOD 1275341791
//2 147 483 647 (2^31-1) int max
//9 223 372 036 854 775 807 (2^63-1) ll max

//codeforces and USACO
void fast_io(){
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);}

//USACO
void file_io(string taskname){
  string fin = taskname + ".in";
  string fout = taskname + ".out";
  const char* FIN = fin.c_str();
  const char* FOUT = fout.c_str();
  freopen(FIN, "r", stdin);
  freopen(FOUT, "w", stdout);
  fast_io();}

//Printing pairs and vectors
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";}

//main code
int main(){
  fast_io();
  int n;
  cin >> n;
  vector<pair<int,int>>a(n);
  forn(i,n){
    int x,y;
    cin >> x >> y;
    a[i]=mp(x,y);
  }
  bool mybool=false;
  forn(i,n){
    forn(j,n){
      forn(k,n){
        if (i==j or i==k or j==k){
          continue;
        }
        vector<pair<int,int>>points;
        points.pb(a[i]);
        points.pb(a[j]);
        points.pb(a[k]);
        sort(points.begin(),points.end()); //sorting by increasing x
        if (((double)points[2].s-points[0].s)/(points[2].f-points[0].f)==((double)points[1].s-points[0].s)/(points[1].f-points[0].f)){
          mybool=true;
        }
      }
    }
  }
  if (mybool){
    cout << "Yes";
  }
  else{
    cout << "No";
  }
}
