#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <fstream>
#include <cmath>
#include <stack>
#include <numeric>
#include <iomanip>
using namespace std;

int main(){
    int n;cin>>n;
    vector<long long> a(n);
    map<long long,long long> mp;
    for(int i=0;i<n;i++) {
        cin >> a[i];
    }
    vector<long long> nozero;
    int c = 0;
    sort(a.begin(),a.end(),greater<long long>());
    long long maxv = a[0];
    for(int i=0;i<n;i++) {
        if(a[i]==0) {
            c++;
            continue;
        }
        nozero.push_back(a[i]);
        mp[a[i]]++;
    }
    vector<long long> diff;
    sort(nozero.begin(),nozero.end());
    for(int i=0;i<nozero.size()-1;i++) diff.push_back(nozero[i+1]-nozero[i]);
    sort(diff.begin(),diff.end());
    //for(int i=0;i<diff.size();i++) cout << diff[i] << " ";
    //cout << endl;
    long long mindiff = diff[0];
    
    vector<long long> pb(n);
    pb[0] = maxv;
    for(int i=1;i<n;i++) pb[i] = pb[i-1] - mindiff;
    map<long long,long long> mpb;
    for(int i=0;i<n;i++) mpb[pb[i]]++;
    //for(int i=n-1;0<=i;i--) cout << pb[i] << " ";
    //cout << endl; 
    for(auto x:mp){
        mpb[x.first]--;
        if(mpb[x.first]<0){
          cout << "No" << endl;
          return 0;
        } 
    }
    cout << "Yes" << endl;
}