void main()
{
	const N=readInt;
	long sum=0;
	auto A=new int[N];
	foreach(i;0..N)
	{
		A[i]=readInt;
		sum+=A[i];
	}
	if(sum%N!=0)
	{
		writeln("No");
		return;
	}
	foreach(i;0..N)
	{
		if((A[0]%N+N)%N!=(A[i]%N+N)%N)
		{
			writeln("No");
			return;
		}
	}
	writeln("Yes");
}

import std;

string[]__READ;
string readString(){while(__READ.empty()){__READ=readln.chomp.split;}auto ret=__READ.front;__READ.popFront;return ret;}
int readInt(){return readString.to!int;}
uint readuInt(){return readString.to!uint;}
long readLong(){return readString.to!long;}
ulong readuLong(){return readString.to!ulong;}
double readDouble(){return readString.to!double;}
real readReal(){return readString.to!real;}

bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}

int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}