/*    BISMILLAHIR-RAHMANIR-RAHIM
 ____________________________________
|                                    |
|      SHANTO_SUST_SWE-19__029       |
|      shanto-swe029.github.io       |
|____________________________________|
*/

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

#define ll          long long
#define fastio      ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb          push_back
#define Pi          acos(-1.0)
#define r0          return 0
#define endl        "\n"
#define show(x)     cout << x << endl
#define take(x)     cin >> x
#define debug       1

int main()
{
	int n;
	std::cin >> n;
	std::vector < pair < int, int > > v;
	std::pair < int, int > p;
	for( int i = 0; i < n; i++ ) {
		int x, y;
		std::cin >> x >> y;
		p.first = x;
		p.second = y;
		v.push_back(p);
	}
	bool gotcha = false;
	for( int i = 0; i < n; i++ ) {
		for( int j = i + 1; j < n; j++ ) {
			for( int k = j + 1; k < n; k++ ) {
				int det = v[i].first * v[j].second + v[j].first * v[k].second + v[k].first * v[i].second;
				det -= v[i].second * v[j].first + v[j].second * v[k].first + v[k].second * v[i].first;
				if( det == 0 ) {
					gotcha = true;
					break;
				}
			}
			if( gotcha ) break;
		}
		if( gotcha ) break;
	}
	if( gotcha ) std::cout << "Yes";
	else std::cout << "No";

    r0;
}

//ALHAMDULILLAH

#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() {
    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-2; i++) {
        for (int j = i+1; j < n-1; j++) {
            for (int k = j+1; k < n; k++) {
                if ((y[i]-y[j]) * (x[i]-x[k])  == (y[i]-y[k]) * (x[i]-x[j])) ok = true;
            }
        }
    } 
    if (ok) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;    
}