#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)

ll positive_modulo(ll i, ll n) {
    return (i % n + n) % n;
}

void solve(){
    int n; cin >> n;
    ll average = 0;
    vector<ll> a(n);
    rep(i,0,n){
        cin >> a[i];
        average += a[i];
    }
    if(average % n != 0){
        cout << "No";
        return;
    }
    average /= n;
    ll need = 0;
    ll give = 0;
    rep(i,0,n){
        ll p = a[i];
        while(p > average){
            p -= n-1;
            give += 1;
        }
        need += average-p;
    }
    cout << (give*(n-1) == need ? "Yes" : "No" );
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    rep(i,0,t) solve();

    return 0;
}