#include <iostream>
#include <math.h>
#include <algorithm>
#include <queue>
#include <map>
#include <list>
//#include <bits/stdc++.h>


using namespace std;

#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
typedef long long ll;

int main(){
    ll n;
    
    cin >> n;
    vector<ll> a(n);


    if (n%3 != 0){cout << "No" << endl;}
    else{
        
        for(ll i=0;i<n;i++){
            cin >> a[i];
        }
        sort(a.begin(),a.end());
        a.erase( unique(a.begin(), a.end()), a.end() );
        
        if(a.size()>3){cout << "No" << endl;}
        else if(a.size()==2){
            if(a[0]==0){cout << "Yes" << endl;}
            else{cout << "No" << endl;}
        }
        else if((a.size()==1){
            if(a[0]==0){cout << "Yes" << endl;}
            else{cout << "No" << endl;}
        })
        else{
            if(a[0]+a[1]==a[2]){cout << "Yes" << endl;}
            else{cout << "No" << endl;}
        }
    }

    return 0;
}