#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <list>
#include <cassert>
#include <numeric>
#include <cstdint>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <random>
// #include <atcoder/all>
 
using ll = long long;
using ld = long double;
using namespace std;
// using namespace atcoder;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;
using Priority = priority_queue<ll, vector<ll>, greater<ll>>;// 昇順
using Priority_pair = priority_queue<P, vector<P>, greater<P>>;
// using mint_17 = modint1000000007;
// using mint = modint998244353;

#define mod 1000000007
#define MAX_WIDTH 60
#define MAX_HEIGHT 60
#define INF 1e18
#define MOD 998244353
#define PI 3.141592653589793
#define rep(i, s, n) for (ll i=(s);i<(n);i++)
#define rrep(i, s, n) for (ll i=(n);i>=(s);i--)
#define all(v) (v).begin(), (v).end()
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define pb(n) push_back(n)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define vc vector<char>
#define vp vector<pair<ll, ll>>
#define mll map<ll, ll>
#define msl map<string, ll>
#define COUT(n) cout << (n) << endl
#define isInGrid(n, h, w) (0 <= (n) && (n) < (h) && 0 <= (n) && (n) < (w))
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

ll N, A[200010];
int main() {
    cin >> N;
    ll cnt = 0;
    vll B;
    rep(i, 0, N) {
        cin >> A[i];
        if(A[i] == 0) cnt++;
        else {
            B.pb(A[i]);
        }
    }
    sort(all(B));

    ll s = B.size(), mn = INF;
    priority_queue<ll> que;
    rep(i, 0, s-1) {
        mn = min(mn, B[i+1]-B[i]);
        que.push(B[i+1]-B[i]);
    }

    bool ok = true;
    rep(i, 0, cnt) {
        ll t = que.top(); que.pop();
        if(t == mn) {
            COUT("Yes");
            return 0;
        }
        if(t % 2 == 0) {
            que.push(t/2);
            que.push(t/2);
        } else {
            que.push(t/2);
            que.push((t/2)+1);
        }
    }

    while(!que.empty()) {
        ll t = que.top(); que.pop();
        if(t != mn) {
            ok = false;
        }
    }

    Yes(ok);

    return 0;
}