#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>


using namespace std;
#define PI acos(-1)
using P =pair<ll,ll>;




ll mod=1e9+7;
ll dp[2000+4];

vector<pair<ll,ll>>p;

vector<ll> to[100005];
ll inf =1000000007;

ll keta(ll n){
    ll ans=0;
    while(n!=0){
        ans++;
        n/=10;
    }
    return ans;
}

ll kazu(ll i){
    ll ans=0;
    for(ll k=1;k*k<=i;k++){
        if(i%k==0){
            if(i/k==k)ans++;
            else ans+=2;
        }
    }
    return ans;
}

int main()
{
ll n;
cin>>n;
vector<float>x(n);
vector<float>y(n);
rep(i,n)cin>>x[i]>>y[i];
rep(i,n){
    if(x[i]==x[i+1]){
        for(ll j=i+2;j<n;j++){
            if(x[i]==x[j]){
                cout<<"Yes"<<endl;
                return 0;
            }
        }
    }else{
        for(ll k=i+1;k<n;k++){
          float lean=(y[k]-y[i])/(x[k]-x[i]);
          for(ll j=k+1;j<n;j++){
            float tmp=(y[j]-y[i])/(x[j]-x[i]);
            if(lean==tmp){
              cout<<"Yes"<<endl;
              return 0;
            }
          }    
        }
    }
}
cout<<"No"<<endl;
}
 


 

 





#include<bits/stdc++.h>
using namespace std;

typedef long long int in;

int main()
{
    in n,i,j,k;
    cin>>n;

    in a[n],b[n];

    for(i=0;i<n;++i)
    cin>>a[i]>>b[i];

    for(i=0;i<n;++i)
    for(j=i+1;j<n;++j)
    for(k=j+1;k<n;++k)
    {
        in val=a[i]*(b[j]-b[k])+a[j]*(b[k]-b[i])+a[k]*(b[i]-b[j]);

        if(val==0)
        {
            cout<<"Yes";
            return 0;
        }
    }

    cout<<"No";

    return 0;
}