#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)

    typedef long long ll;
    typedef unsigned long long ull;
    using P=pair<ll,ll>;
    using tp=tuple<ll,ll,ll>;
    const int INF=1001001001;
    const ll INFL=1e18;
    const int mod=998244353;

    void solve(){
        int n;
        cin>>n;
        vector<ll>a(n);
        rep(i,n)cin>>a[i];

        int z=count(a.begin(),a.end(),0);
        sort(a.begin(),a.end());
        int st=0;
        while(st<n&&a[st]==0)st++;

        ll g=0,i=st;
        bool ok=false;
        while(i+1<n){
            g=__gcd(a[i+1]-a[i],g);
            if(a[i+1]-a[i]==0){ok=true;}
            i++;
        }
        i=st;
        while(i+1<n){
            if(ok&&a[i+1]-a[i]!=0){
                cout<<"No"<<endl;
                return;
            }
            i++;
        }
        
        if(g==0){
            cout<<"Yes"<<endl;
            return;
        }
        
        ll cnt=0;
        for(int j=st;j+1<n;j++){
            cnt+=(a[j+1]-a[j])/g-1;
        }
        cout<<(cnt<=z?"Yes":"No")<<endl;
    }  

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve();
        
        return 0;
    }