#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>//fixed,setprecision
//#include <limits.n>//INT_MAX
//#include <math.n>//M_PI
#include <random>
#include <regex> // 正規表現
#include <time.h>
#include <fstream>
//#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
// using mint = modint998244353;
// using mint=modint;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RC(r, c) ((r) * N + (c))
#define R(rc) (rc / N)
#define C(rc) (rc % N)
typedef pair<int,int> P;
//文字列が含まれるかどうか
bool aru(){
	string s;
	cin>>s;
	vector<string>t={"ACE","BDF","CEG","DFA","EGB","FAC","GBD"};
	return find(t.begin(),t.end(),s)!=t.end();
}
int main(){
	int n;
	cin>>n;
	vector<ll>a(n);
	ll sum=0;
	rep(i,n){
		cin>>a[i];
		sum+=a[i];
	}
	if(sum%n==0)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}