#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
#define LOG(...) cerr << "[" << #__VA_ARGS__ << "]: " << repr(__VA_ARGS__) << endl;
#define MSG(args) cerr << args << "\n";
#define debug(x) x
#else
#define LOG(...)
#define MSG(args)
#define debug(x)
#endif

#define mp make_pair
#define pb push_back
#define sz(x) (int)((x).size())
#define ms(x, v) memset((x), v, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define REP(x, n) for(int x = 0; x < n; x++)
#define REPV(x, v, n) for(int x = v; x < n; x++)
#define REVE(x, n) for(int x = n; x >= 0; x--)

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
using vvi = vector<vi>;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vii p(N);
    for(auto &x : p) cin >> x.first >> x.second;
    bool ok = false;
    REP(i, N)
	REPV(j, i + 1, N)
	    REPV(k, j + 1, N)
	    {
		vii tmp({p[i], p[j], p[k]});
		sort(all(tmp));
		ll m1 = (tmp[2].second - tmp[1].second) * 1LL * (tmp[1].first - tmp[0].first);
		ll m2 = (tmp[1].second - tmp[0].second) * 1LL * (tmp[2].first - tmp[1].first);
		if((ok = m1 == m2)) goto en;
	    }
en:;
    if(ok) cout << "Yes\n";
    else cout << "No\n";
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

int main() {
	int n;
	cin >> n;
	vector<int> x(n), y(n);
	rep(i, n){
		cin >> x[i] >> y[i];
	}

	for(int i = 0; i < n - 2; i++){
		for(int j = 1; j < n - 1; j++){
			for(int k = 2; k < n; k++){
				if (i == j || j == k || k == i)
					continue;
				if ((y[j] - y[i]) * (x[k] - x[i]) == (y[k] - y[i]) * (x[j] - x[i])){
					cout << "Yes" << endl;
					return (0);
				}
			}
		}
	}
	cout << "No" << endl;
}
