#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <set>
#include <list>
#include <queue>
#include <map>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
int n,a[110];
int solve()
{
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
        {
            if(j == i)
                continue;
            for(int k = 0; k < n; k++)
            {
                if(i == k || j == k)
                    continue;
                if(a[i]-a[j] == a[k])
                    return 1;
            }
        }
    return 0;
}
int main()
{
    int t,C = 1;
    //printf("%d\n",2<<1|1);
    //scanf("%d",&T);
    while(scanf("%d",&n) != EOF)
    {
        for(int i = 0; i < n; i++)
            scanf("%d",&a[i]);
        if(solve())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}