#include <bits/stdc++.h>
using namespace std;

#define int long long
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define vb vector<bool>
#define vpii vector<pair<int, int>>
#define vpic vector<pair<int, char>>
#define vpis vector<pair<int, string>>
#define pb push_back
#define pii pair<int, int>
#define rep(i, s, e) for (int i = (s); i < (e); i++)
#define all(x) x.begin(), x.end()
#define fastio ios::sync_with_stdio(false); cin.tie(0);

void dfs(int i,int j, vector<vector<int>> &v, int n, int m){
    v[i][j] = 2;
    queue<pair<int,int>> q;
    q.push({i,j});

    int dx[4] = {-1,0,1,0};
    int dy[4] = {0,1,0,-1};

    while (!q.empty()){
        int x = q.front().first;
        int y = q.front().second;
        q.pop();

        for(int i=0; i<4; i++){
            int newx = x + dx[i];
            int newy = y + dy[i];

            if(newx >= 0 && newx < n && newy >=0 && newy < m){
                if(v[newx][newy] != 0 && v[newx][newy] != 2){
                    q.push({newx,newy});
                    v[newx][newy] = 2;
                }
            }
        }
    }
    

}

signed main()
{
    fastio;

    int n;
    cin>>n;

    vector<int> a(n);

    for(int i=0; i<n; i++){
        cin>>a[i];
    }

    bool f = true;

    for(int i=0; i<n/2; i++){
        if(a[i]+a[n-1-i] != a[0]+a[n-1]){
            f = false;
            break;
        }
    }

    if(f) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;

}