#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <queue>
#include <string>
#include <iomanip>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <stdio.h>
#include <math.h>
#include <assert.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll=long long;

long long gcd(long long x,long long y){
  long long tmp;
  while(y!=0){
    tmp=y;
    y=x%y;
    x=tmp;
  }
  return x;
}

int main(){
  ll N;
  cin>>N;
  vector<ll>A(N);
  for(int i=0;i<N;i++){
    cin>>A[i];
  }
  ll cnt=0;
  vector<ll> B;
  B.reserve(N);
  for(int i=0;i<N;i++){
    if(A[i]==0){
      cnt++;
    }else{
      B.emplace_back(A[i]);
    }
  }
  sort(B.begin(),B.end());
  ll sa=0;
  for(int i=0;i<(int)B.size()-1;i++){
    sa=gcd(sa,B[i+1]-B[i]);
  }
  if(sa==0){
    for(ll i:B){
      if(i!=B[0]){
        sa=1000000000000000LL;
        for(int i=0;i<(int)B.size()-1;i++){
          sa=min(sa,B[i+1]-B[i]);
        }
        if(sa==0){
          for(ll i:B){
            if(i!=B[0]){
              cout<<"No"<<endl;
              return 0;
            }
          }
          cout<<"Yes"<<endl;
          return 0;
        }
        ll must=0;
        for(int i=0;i<(int)B.size()-1;i++){
          if((B[i+1]-B[i])%sa){
            cout<<"No"<<endl;
            return 0;
          }
          must+=(B[i+1]-B[i])/sa-1;
        }
        //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
        if(must>cnt){
          cout<<"No"<<endl;
        }else{
          cout<<"Yes"<<endl;
        }
        return 0;
      }
    }
    cout<<"Yes"<<endl;
    return 0;
  }
  ll must=0;
  for(int i=0;i<(int)B.size()-1;i++){
    if((B[i+1]-B[i])%sa){
      sa=1000000000000000LL;
      for(int i=0;i<(int)B.size()-1;i++){
        sa=min(sa,B[i+1]-B[i]);
      }
      if(sa==0){
        for(ll i:B){
          if(i!=B[0]){
            cout<<"No"<<endl;
            return 0;
          }
        }
        cout<<"Yes"<<endl;
        return 0;
      }
      ll must=0;
      for(int i=0;i<(int)B.size()-1;i++){
        if((B[i+1]-B[i])%sa){
          cout<<"No"<<endl;
          return 0;
        }
        must+=(B[i+1]-B[i])/sa-1;
      }
      //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
      if(must>cnt){
        cout<<"No"<<endl;
      }else{
        cout<<"Yes"<<endl;
      }
      return 0;
    }
    must+=(B[i+1]-B[i])/sa-1;
  }
  //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
  if(must>cnt){
    sa=1000000000000000LL;
    for(int i=0;i<(int)B.size()-1;i++){
      sa=min(sa,B[i+1]-B[i]);
    }
    if(sa==0){
      for(ll i:B){
        if(i!=B[0]){
          cout<<"No"<<endl;
          return 0;
        }
      }
      cout<<"Yes"<<endl;
      return 0;
    }
    ll must=0;
    for(int i=0;i<(int)B.size()-1;i++){
      if((B[i+1]-B[i])%sa){
        cout<<"No"<<endl;
        return 0;
      }
      must+=(B[i+1]-B[i])/sa-1;
    }
    //cerr<<sa<<" "<<must<<" "<<cnt<<endl;
    if(must>cnt){
      cout<<"No"<<endl;
    }else{
      cout<<"Yes"<<endl;
    }
  }else{
    cout<<"Yes"<<endl;
  }
}