#include #define rep(i, n) for (int i = 0; i < (n); ++i) #define srep(i, s, t) for (int i = s; i < t; ++i) #define drep(i, n) for (int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define MAX_N 200005 int main() { int n; cin >> n; ll sum = 0; rep(i, n) { int a; cin >> a; sum += a; } if (sum % n == 0) { puts("Yes"); } else { puts("No"); } return 0; }