#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define int long long
#define sim template <class c
#define ris return *this
#define dor > debug& operator<<
#define eni(x)                                                                 \
    sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(   \
              c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c> {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
	~debug() { cerr << endl; }
	eni( != ) cerr << boolalpha << i;
	ris;
} eni( == ) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
	ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
	*this << "[";
	for (auto it = d.b; it != d.e; ++it)
		*this << ", " + 2 * (it == d.b) << *it;
	ris << "]";
}
#else
	sim dor(const c&) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

template <typename T>
using indexed_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T> bool umin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool umax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define in insert
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define sz(v) (int)(v.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mem(a, s) memset(a, s, sizeof(a))
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define repr(i, a, b) for (int i = a; i >= b; --i)
#define MAX 8000000000000000064LL
#define MIN -8000000000000000064LL

typedef vector<int> vi;
typedef stack<int> sti;
typedef queue<int> qi;
typedef pair<int, int> pii;
typedef set<int> si;
typedef map<int, int> mii;
typedef vector<pii> vpi;
typedef priority_queue<int> pqmax;
typedef priority_queue<int, vector<int>, greater<int>> pqmin;

const int mod = 1e9 + 7;
const int inf = 1e18;
const int d4x[4] = { -1, 0, 1, 0}, d4y[4] = {0, 1, 0, -1};
const int d8x[8] = { -1, -1, 0, 1, 1, 1, 0, -1}, d8y[8] = {0, 1, 1, 1, 0, -1, -1, -1};

void solve();

int32_t main() {

	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cout.precision(20);

	int t = 1;
	// cin >> t;
	rep(i, 1, t) {
		// cout << "Case #" << i << ": ";
		solve();
	}

	return 0;
}

void solve() {
	int n;
	cin >> n;
	vector<pii> v;
	rep(i, 0, n - 1) {
		int x, y;
		cin >> x >> y;
		v.pb(mp(x, y));
	}
	int count = 0;
	bool flag = 0;
	rep(i, 0, n - 1) {
		rep(j, i + 1, n - 1) {
			rep(k, j + 1, n - 1) {
				if ((v[j].se - v[i].se) * (v[k].fi - v[j].fi) == (v[k].se - v[j].se) * (v[j].fi - v[i].fi)) {
					flag = 1;
					break;
				}
			}
		}
	}
	(flag == 0) ? cout << "No\n" : cout << "Yes\n";
}
#include <bits/stdc++.h>
using namespace std;

int main() {
    typedef long long ll;
    ll n;
    cin >> n;
    vector<ll> x;
    vector<ll> y;
    bool isYes = false;

    for(int i=0; i<n; i++){
        ll a, b;
        cin >> a >> b;
        x.push_back(a);
        y.push_back(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++){
                // cout << i << "," << j << "," << k <<"." << endl;
                ll dx1 = x[i] - x[j];
                ll dx2 = x[i] - x[k];
                ll dy1 = y[i] - y[j];
                ll dy2 = y[i] - y[k];
                if(dx2*dy1 == dx1*dy2){ 
                    cout << "Yes" << endl;
                    return 0;
                }
            }
        }
    }
    cout << "No" << endl;
    return 0;
}