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

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,s,n) for (int i=(s); i<(int)(n); i++) 
#define all(v) v.begin(),v.end()

using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vs=vector<string>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vvvl=vector<vvl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pi=pair<int,int>;
using pl=pair<ll,ll>;
using si=set<int>;
using sl=set<long long>;
using ss=set<string>;
using svi=set<vi>;
using svl=set<vl>;
using svs=set<vs>;
using sb=set<bool>;
using vpi=vector<pi>;
using vpl=vector<pl>;
using spi=set<pi>;
using spl=set<pl>;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};
template<typename T> using pq=priority_queue<T>;

int main() {
  int n;
  cin>>n;
  vi a(n);
  bool ok=true;
  rep(i,n)cin>>a[i];
  int x=a[0]+a.back();
  rep(i,n){
    if(a[i]+a[n-1-i]!=x)ok=false;
  }
  cout<<(ok?"Yes":"No")<<endl;
}