#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    ll N, S=0, T=0;
    cin >> N;
    
    vector<ll> A(N), B(N);
    for (int i=0; i<N; i++){
        cin >> A[i];
        S += A[i];
    }

    if (S % N != 0){
        cout << "No" << endl;
        return 0;
    }

    S /= N;
    for (int i=0; i<N; i++) B[i] = A[i]-S;
    sort(B.begin(), B.end());

    for (int i=0; i<N; i++){
        if ((B[i]-B[0]) % N != 0){
            cout << "No" << endl;
            return 0;
        }
        T += (B[i]-B[0])/N;
    }

    cout << (T == -B[0] ? "Yes" : "No") << endl;

    return 0;
}