#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

bool solve(){
    int n; cin >> n;
    vector<ll> v; ll cnt = 0;
    for(int i=0;i<n;i++){
        ll a; cin >> a;
        if(a) v.push_back(a);
        else cnt++;
    }
    if(v.size() <= 1)return true;
    sort(v.begin(), v.end());
    {
        ll p = -1;
        for(int i=0;i+1<v.size();i++){
            if(v[i] == v[i+1]) p = v[i];
        }
        if(p != -1){
            for(int i=0;i<v.size();i++){
                if(p != v[i]) return false;
            }
            return true;
        }
    }
    ll g = 0;
    for(int i=0;i+1<v.size();i++){
        g = gcd(g, v[i+1]-v[i]);
    }
    for(int i=0;i+1<v.size();i++){
        ll u = v[i+1]-v[i];
        u /= g;
        cnt -= u-1;
        if(cnt < 0)return false;
    }
    return true;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    if(solve()){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}