#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e2+5;
int x[N],y[N];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i];
    }
    int flag=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            for(int k=j+1;k<=n;k++)
            {
               if(x[i]*y[j]-x[j]*y[i]+x[j]*y[k]-x[k]*y[j]+x[k]*y[i]-y[k]*x[i]==0)
                {
                    flag=1;
                    //cout<<x[i]<<" "<<y[i]<<" "<<x[j]<<" "<<y[j]<<" "<<x[k]<<" "<<y[k]<<endl;
                    break;
                }
            }
            if(flag==1)
                break;
        }
        if(flag==1)
            break;
    }
    if(flag==1)
        cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;


}

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;


int main() {
    ll N;
    cin >> N;

    vector<ll> x(N);
    vector<ll> y(N);
    rep(i, N) {
        cin >> x.at(i) >> y.at(i);
    }

    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 ((x.at(k) - x.at(i)) * (y.at(j) - y.at(i)) == (x.at(j) - x.at(i)) * (y.at(k) - y.at(i))) {
                   cout << "Yes" << endl;
                   return 0;
                }
            }
        }
    }

    cout << "No" << endl;

}
