import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); } void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; } T rtype(T)(){ return read.to!T; } alias rint = rtype!int, rlong = rtype!long, rreal = rtype!real; T[] rtypes(T)(int n){ return n.iota.map!(i => rtype!T()).array; } alias rint = rtypes!int, rlong = rtypes!long, rreal = rtype!real; // ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //
void solve(){
 	int n = rint;
 	long[] as = rlong(n);
 	
 	long m = n * (n + 1) / 2;
 	if(as.sum % m != 0){ 		"NO".writeln; 		return; 	} 	 

  long c = as.sum / m;
  
  long cnt;
  foreach(i; 0 .. n){
   long d = as[i] - as[(i + 1) % n];
   // u(n - 1) - (c - u) = d
   if((d + c) % n != 0){
    "NO".writeln; 		return; 
   }
   cnt += (d + c) / n;
  }

   if(c != cnt){
    "NO".writeln; 		return; 
   }
 	"YES".writeln;
} 
