#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
    int n;
    cin>>n;
    vector<ll> a(n);
    ll mx=0,mn=1e18;
    vector<ll> t;
    ll cnt=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
        if(a[i]!=0){
            mx=max(mx,a[i]);
            mn=min(mn,a[i]);
            t.push_back(a[i]);
        }else{
            cnt++;
        }
    }
    ll Mn=1e18;
    sort(t.begin(),t.end());
    for(int i=1;i<t.size();i++){
        Mn=min(Mn,t[i]-t[i-1]);
    }
    if(Mn==0){
        if(mx-mn==0) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
        return 0;
    }
    if((mx-mn)%Mn==0&&(mx-mn)/Mn-1ll<=cnt) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}