#include #if defined(ATCODER)==defined(ONLINE_JUDGE) #include using namespace atcoder; using ml=modint998244353; auto&operator<<(std::ostream&o,const ml&x){return o<>(std::istream&i,ml&x){long long t;i>>t;x=t;return i;} #endif namespace my{void main();} int main(){my::main();} namespace my{ #define eb emplace_back #define all(a) (a).begin(),(a).end() #define done(...) rr pp(__VA_ARGS__) #define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__) #define LL(...) RD(ll,__VA_ARGS__) #define VL(n,...) vl __VA_ARGS__;setsize({n},__VA_ARGS__);li(__VA_ARGS__) #define JO(a,b) a##b #define jo(a,b) JO(a,b) #define usymbol(a) jo(a,__LINE__) #define FE(v,e,...) for(au&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):v) #define FO(n) for(ll usymbol(i)=n;usymbol(i)-->0;) #define FOR(i,...) for(au[i,i##O,i##E]=rng(0,__VA_ARGS__);i=i##O;i-=i##E) #define I template #define J class #define au auto #define rr return using namespace std; using vo=void;using bo=bool; vo solve(); Iconstexpr bo same=is_same_v; using is=istream;using os=ostream; using dd=long double;using ll=long long;using ull=unsigned long long; using lll=__int128_t;using ulll=__uint128_t;using str=string; os&operator<<(os&o,const ulll&x){rr(x<10?o:o<0?x:-x);} constexpr dd ee=1e-12; constexpr ll oo=3e18; constexpr ll dx[]{-1,0,1,0,-1,1,1,-1},dy[]{0,-1,0,1,-1,-1,1,1}; constexpr char sp=32; constexpr char nl=10; au yes(bo y){rr y?"Yes":"No";} au no(){rr yes(0);} au rng(bo s,ll a,ll b=oo,ll c=1){if(b==oo)b=a,(s?b:a)=0;rr tuple{a-s,b,c};} Ill len(const T&a){rr a.size();} Istruct cp{ A a={};B b={}; cp(){} cp(A a,B b):a(a),b(b){} cp(pairp):a(p.first),b(p.second){} bo operator==(const cp&c)const{rr a==c.a&&b==c.b;} bo operator<(const cp&c)const{rr a!=c.a?a(const cp&c)const{rr a!=c.a?a>c.a:b>c.b;} friend is&operator>>(is&i,cp&c){rr i>>c.a>>c.b;} friend os&operator<<(os&o,const cp&c){rr o<; Istruct tr{ A a={};B b={};C c={}; tr(){} tr(A a,B b,C c):a(a),b(b),c(c){} bo operator==(const tr&t)const{rr a==t.a&&b==t.b&&c==t.c;} au operator<(const tr&t)const{rr a!=t.a?a>(is&i,tr&t){rr i>>t.a>>t.b>>t.c;} friend os&operator<<(os&o,const tr&t){rr o<; Iusing ar=array; Ios&operator<<(os&o,const ar&a){foo(i,n)o<using map=std::map; Ios&operator<<(os&o,const map&m){fee(m,e)o<using umap=unordered_map; Ios&operator<<(os&o,const umap&m){fee(m,e)o<using bset=bitset; Ios&operator<<(os&o,const bset&b){foo(i,n)o<os&operator<<(os&o,const tuple&t){apply([&](const au&...a){ll i=sizeof...(a);(((o<0,sp))),...);},t);rr o;} Istruct prique:priority_queue,F>{ prique(const initializer_list&a={}){fee(a,e)this->emplace(e);} prique(const vector&a){fee(a,e)this->emplace(e);} T sum()const{au q=*this;T r{};while(len(q))r+=q.pot();rr r;} friend T bg(prique&q){rr q.top();} friend T pot(prique&q){T r=q.top();q.pop();rr r;} friend os&operator<<(os&o,prique q){while(len(q))o<0,sp);rr o;} }; Iusing qmax=prique>; Iusing qmin=prique>; Istruct ve; Iconstexpr bo isv=0; Iconstexpr bo isv> =1; Iconstexpr bo isv> =1; Iau rawv(V){if constexpr(isv)rr rawv(V(1)[0]);else rr V();} Istruct ve:vector{ using vector::vector; using T=decltype(rawv(V())); Ive(const vector&v={}){static_assert(isv ==isv);fee(v,e)this->eb(e);} ve&operator+=(const ve&u){au&v=*this;foo(i,len(v))v[i]+=u[i];rr v;}ve operator+(const ve&u)const{rr ve(*this)+=u;} ve&operator-=(const ve&u){au&v=*this;foo(i,len(v))v[i]-=u[i];rr v;}ve operator-(const ve&u)const{rr ve(*this)-=u;} ve&operator^=(const ve&u){fee(u,e)this->eb(e);rr*this;}ve operator^(const ve&u)const{rr ve(*this)^=u;} ve&operator+=(const T&x){au&v=*this;fee(v,e)e+=x;rr v;}ve operator+(const T&x)const{rr ve(*this)+=x;} ve&operator-=(const T&x){au&v=*this;fee(v,e)e-=x;rr v;}ve operator-(const T&x)const{rr ve(*this)-=x;} ve&operator*=(const T&x){au&v=*this;fee(v,e)e*=x;rr v;}ve operator*(const T&x)const{rr ve(*this)*=x;} ve&operator++(){rr*this+=1;} ve&operator--(){rr*this-=1;} ve operator-()const{rr ve(*this)*=-1;} Iau&operator+=(const bset&a){foo(i,n)(*this)[i]+=a[i];rr*this;} Iau&operator-=(const bset&a){foo(i,n)(*this)[i]-=a[i];rr*this;} au lower_bound(const V&x)const{rr std::lower_bound(all(*this),x);} au upper_bound(const V&x)const{rr std::upper_bound(all(*this),x);} Iau scan(F f)const{cpr;fee(*this,e)if constexpr(!isv)r.b?f(r.a,e),r:r={e,1};else if(au s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;rr r;} T sum()const{rr scan([](T&a,const T&b){a+=b;}).a;} friend is&operator>>(is&i,ve&v){fee(v,e)i>>e;rr i;} friend os&operator<<(os&o,const ve&v){fee(v,e)o<?nl:sp);rr o;} }; Iau vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)rr ve(s[i],x);else{au X=vec(s,x);rr ve(s[i],X);}} Ivo setsize(const ll(&l)[n],A&...a){((a=vec(l,rawv(a))),...);} Iusing vve=ve>;using vl=ve;using vvl=vve; using gl=vve;using ge=vve; vo io(){cin.tie(0)->sync_with_stdio(0);cout<vo li(A&...a){(cin>>...>>a);} Ivo pp(const A&...a){ll i=sizeof...(a);((cout<0,c)),...);cout<struct rec:F{rec(F&&f):F(std::forward(f)){}Idecltype(au)operator()(A&&...a)const{rr F::operator()(*this,std::forward(a)...);}}; vo main(){io();ll T=1;foo(T)solve();} vo solve(){ LL(N); VL(N,a); if(a.sum()%N)done(no()); pp(yes(1)); }}