#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
// const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
int main(){
    int n;
    cin>>n;
    V<ll> a(n);
    V<ll> tmp;
    for(int i=0;i<n;i++){
        cin>>a[i];
        if(a[i]!=0)tmp.emplace_back(a[i]);
    }
    sort(all(tmp));
    int sz=tmp.size();
    if((int)tmp.size()<3){
        cout<<"Yes"<<"\n";
        return 0;
    }
    ll g=0,mi=inf;
    for(int i=0;i<sz-1;i++){
        g=gcd(g,tmp[i+1]-tmp[i]);
        chmin(mi,tmp[i+1]-tmp[i]);
    }
    if(mi==0&&g!=0){
        cout<<"No"<<"\n";
    }else if(g==0){
        cout<<"Yes"<<"\n";
    }else{
        ll rem=n-sz;
        for(int i=0;i<sz-1;i++){
            rem-=((tmp[i+1]-tmp[i])/g-1);
            if(rem<0)break;
        }
        if(rem>=0){
            cout<<"Yes"<<"\n";
        }else{
            cout<<"No"<<"\n";
        }
    }
}