#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long> 
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld\n", x)
#define ci(x) cin >> x
#define ci2(x, y) cin >> x >> y
#define ci3(x, y, z) cin >> x >> y >> z
#define co(x) cout << x << endl
#define co2(x, y) cout << x << y << endl
#define co3(x, y, z) cout << x << y << z << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> PQ;
typedef priority_queue<int, vector<int>, greater<int>> PQG;
typedef priority_queue<P> PQP;
typedef priority_queue<P, vector<P>, greater<P>> PQPG;

const int MAX_N = 1e2, MOD = 1e9 + 7, INF = 1e9;
int n, x[MAX_N], y[MAX_N];

int main() {
    ci(n);
    rep(i, n) ci2(x[i], y[i]);
    bool ans = false;
    for (int i = 2; i < n; i++) {
        for (int j = 1; j < i; j++) {
            for (int k = 0; k < j; k++) {
                if ((x[i] - x[k]) * (y[j] - y[k]) ==
                    (y[i] - y[k]) * (x[j] - x[k])) ans = true;
            }
        }
    }
    if (ans) co("Yes");
    else co("No");
    return 0;
}

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>

using namespace std;

#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#define rep(i, n) reps(i, 0, n)
#define rrep(i, n) rreps(i, n, 0)
#define P pair<int, int>
#define vec vector<int>
#define mat vector<vector<int> >

const ll mod = 1000000007;
const int INF = 1001001001;

int main(){
    int a[4];
    rep(i, 4) cin >> a[i];
    int s = 0;
    rep(i, 4) s += a[i];
    rep(i, 1<<4){
        int d = 0;
        rep(j, 4){
            if(((i>>j)&1)) d += a[j];
        }
        if(s - d == d){
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}