#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<P> vp;
typedef vector<PL> vpl;
typedef vector<vector<P>> vvp;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define RFOR(i, a, b) for(ll i = (a); i > b; i--)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define RREP(i, n) for(ll i = n-1; i > -1; i--)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back

template <typename T>
T gcd(T a, T b) {
    return (a == 0) ? b : gcd(b%a, a);
}
template <typename T>
T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec){
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    return vec;
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ll N; cin >> N;
    ll asum = 0;
    vl A(N); REP(i, N) {cin >> A[i]; asum += A[i];};
    
    if(N == 1 ){
        cout << "YES" << endl; return 0;
    }
    vl diff(N, 0);
    REP(i, N){
        ll cur = i, nx = (i+1)%N;
        diff[cur] = A[nx] - A[cur];
    }
    
    ll min_idx = -1, min = LINF; ll sumd = 0;
    REP(i, N){
        ll cur = i%N, nx = (i+1)%N;
        sumd = diff[nx]-diff[cur];
        if(min > sumd){
            min = sumd; min_idx = cur;
        }
    }
    
    vl cnt(N, 0); ll sumdd = 0;
    REP(i, N){
        ll cur = (i+min_idx)%N, nx = (i+1+min_idx)%N;
        ll dd = diff[nx]-diff[cur];
        sumdd += dd;
        if(sumdd == 0) continue;
        if(sumdd < 0 && abs(sumdd)%N == 0){
            cnt[nx] = abs(sumdd)/N;
        }
        //        else if(sumdd > 0 && abs(sumdd)/N){
        //        }
        else{
            cout << "NO" << endstr; return 0;
        }
    }
    
    ll c_all = 0; REP(i, N) c_all += cnt[i];
    
    ll a = 0;
    REP(i, N){
        if(cnt[i] > 0){
            a += cnt[i]*(N-i);
        }
    }
    
    vl sa(N, 0); sa[0] = a;
    FOR(i, 1, N){
        a += c_all;
        if(cnt[i-1] > 0){
            a -= cnt[i-1]*N;
        }
        sa[i] = a;
    }
    
    REP(i, N){
        if(sa[i] != A[i]){
            cout << "NO" << endstr; return 0;
        }
    }
    cout << "YES" << endstr;
    return 0;
}


Measured memory_bytes: 3456