#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
//const int mod = 1000000007;
//const int mod = 998244353;

int main()
{
  int n;
  cin >> n;
  vector<ll> a(n);
  rep(i, 0, n) cin >> a[i];
  ll sum = accumulate(a.begin(), a.end(), 0ll);
  if (sum%n) {
    cout << "No\n";
    return 0;
  }
  rep(i, 1, n) {
    if (abs(a[i] - a[i-1])%n) {
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  return 0;
}