//設定言語check
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <limits.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <queue>
#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
using namespace std;
 
int main(){
  long long int N, L, K, ans = 0, flag = 0 ; 
  int i, j, k, cas, num ;
  cin >> N ;
  long long int A[N+2], B[N+2] ;
  REP(i,N){
    cin >> A[i] >> B[i] ;
  }
  REP(i,N){
    REP(j,i){
      REP(k,j){
        L = (A[i]-A[k]) * (B[i]-B[j]) ;
        K = (A[i]-A[j]) * (B[i]-B[k]) ;
        if(L == K){
          cout << "Yes" << endl ;
          return 0 ;
        }
      }
    }
  }
  
  cout << "No" << endl ;
  return 0 ;
}
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<stack>
#include<queue>
#include<deque>
#include<algorithm>
#include<cmath>
#include<functional>
#include<bitset>
#include<iomanip>
#define _GLIBCXX_DEBUG
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define rep(i,n) for(int i=0;i<n;++i)
#define rep2(i,l,r) for(int i=l;i<=r;++i)
#define rep3(i,l,r) for(int i=l;i>=r;--i)
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

const long long mod=1000000007;
const double PI = acos(-1);

int main(){
    int n;
    cin >> n;
    V<pii> vp(n);
    for(int i=0;i<n;++i){
        cin >> vp[i].fi >> vp[i].se;
    }
    bool ans = false;
    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){
                if((vp[k].fi-vp[i].fi)*(vp[j].se-vp[i].se) == (vp[j].fi-vp[i].fi)*(vp[k].se-vp[i].se)) ans = true;
            }
        }
    }
    if(ans) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}