#include<iostream>
#include<vector>
#include<unordered_map>
#include<utility>
#include<string>
#include<cmath>
#include<algorithm>
#include<climits>
#include<set>
#include<unordered_set>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<map>
#include<iomanip>
#include<math.h>

#define fori(a,b) for(int i = a ; i<b ; i++)
#define forj(a,b) for(int j = a ; j<b ; j++)
#define print(a) cout << a <<" ";
#define ll long long
#define vi vector<int>
#define vb vector<bool>
#define vll vector<long long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int,int>
#define all(a) a.begin(), a.end()
#define PB(n) push_back(n);
#define F first
#define S second
#define nl cout << endl;
#define yesno(b) cout << ((b)? "Yes": "No")

using namespace std;

vb is_prime;

void seive(int n) {
    is_prime.assign(n + 1, true);
    is_prime[0] = is_prime[1] = false;

    for (int i = 2; i * i <= n; ++i) {
        if (is_prime[i]) {
            for (int j = i * i; j <= n; j += i)
                is_prime[j] = false;
        }
    }
}

bool isPrime(ll n) {
    if (n <= 1) return false;
    if (n == 2 || n == 3) return true;
    if (n % 2 == 0 || n % 3 == 0) return false;

    for (ll i = 5; i * i <= n; i += 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    }
    return true;
}

void solve() {
     int n;
     cin >> n;

     vi v(n);
     fori(0,n) cin >> v[i];

     int l = 1 , r = n-2;
         int sum = v[0] + v[n-1];
         bool f = true;
     while(l <= r){
         if(v[l] + v[r] != sum){
              f = false;
              break;
         }
         l++;
         r--;

     }

     if(f){
         yesno(1);
     }
     else{
        yesno(0);
     }
     nl
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    solve();
    return 0;
}