#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy cout<<"Yes"<<endl
#define con cout<<"No"<<endl
#define pi 3.141592653589793
#define eps 0.00000000001
#define INF 1e9+7
#define LINF 1e18+10  
using ll = long long;

using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, double>;
using PPI = pair<P, int>;
using PIP = pair<int, P>;
using Ps = pair<int, string>;

using vi = vector<int>;
using vl = vector<ll>;
using vc = vector<char>;
using vd = vector<double>;
using vs = vector<string>;
using vp = vector<P>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<double>>;
using vvc = vector<vector<char>>;
using vvp = vector<vector<P>>;
using vvb = vector<vector<bool>>;
template <typename T>
bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template <typename T>
bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }

//const ll mod=998244353;
const ll mod = 1e9 + 7;
const ll MAX = 300000;
template <typename T>
T abs(T a) { if (a < 0)return -a; else return a; }//2020/09/30 stdlib has abs(long) abs(long long) error

//////////////////////////////////////
ll gcd(ll a,ll b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int main() {
    //cout<<fixed<<setprecision(10);
    int n;
    cin>>n;
    
    vp x(n);
    rep(i,n)cin>>x[i].fs>>x[i].sc;
    sort(all(x));
    rep(i,n){
        rep(j,i){
            rep(k,j){
                double a1=x[i].fs-x[k].fs,a2=x[i].sc-x[k].sc;
                double b1=x[i].fs-x[j].fs,b2=x[i].sc-x[j].sc;
                double c1=x[j].fs-x[k].fs,c2=x[j].sc-x[k].sc;
                a1=sqrt(a1*a1+a2*a2);
                b1=sqrt(b1*b1+b2*b2);
                c1=sqrt(c1*c1+c2*c2);
                if(abs(b1+c1-a1)<eps){
                    coy;
                    return 0;
                }
            }
        }
    }
    con;
    return 0;
}
#include <math.h>

#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;

int main() {
  int n;
  cin >> n;
  vector<int> x(n), y(n);
  rep(i, n) cin >> x[i] >> y[i];

  bool ok = false;

  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      for (int k = j + 1; k < n; k++) {
        if (x[i] == x[j] && x[i] == x[k]) {
          ok = true;
        } else {
          if (y[k] * (x[i] - x[j]) ==
              (y[i] - y[j]) * x[k] + x[i] * y[j] - x[j] * y[i]) {
            ok = true;
          }
        }
      }
    }
  }
  cout << (ok ? "Yes" : "No");
  return 0;
}
