#include <iostream>
#include <cmath>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>
#include <vector>
#include <array> 
#include <tuple>
#include <algorithm>
using namespace std; 

int main() {
  int N;
  cin >> N;
  int x[N], y[N];
  int a, b, p;
  p=0;
  for (int i=0; i<N; i++){
    cin >> a >> b;
    x[i]=a;
    y[i]=b;
  }
  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 ((y[j]-y[i])*(x[k]-x[i])==(y[k]-y[i])*(x[j]-x[i])){
          p=1;
       }
      }
    }
  }
  if (p==1){
    cout << "Yes" << endl;
  }
  else {
    cout << "No" << endl;
  }
}



#include <bits/stdc++.h>

#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
#define DIV 1000000007
#define ll long long
using namespace std;

const int INF = 1e9+7;

/*
浮動小数点の入力
cout << fixed << setprecision(9) << endl;
*/

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  ll N;
  cin >> N;

  vector<pair<int, int>> A(N);
  loop(0, N, i) {
    ll a, b;
    cin >> a >> b;
    A[i] = make_pair(a, b);
  }

  loop(0, N, i) {
    loop(i+1, N, j) {
      loop(j+1, N, k) {
        double dx = A[j].first - A[i].first;
        double dy = A[j].second - A[i].second;
        double dx2 = A[k].first - A[i].first;
        double dy2 = A[k].second - A[i].second;
        if (dx * dy2 == dx2 * dy) {
          print("Yes");
          return 0;
        }
      }
    }
  }
  print("No");
}
