#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=101000;
int n,a[N],b[N],lag[N];
bool solve() {
	rep(i,0,n) lag[i]=a[i]>b[i];
	rep(i,0,n) if (lag[i]&&lag[(i+1)%n]) {
		return false;
	}
	VI op;
	rep(i,0,n) if (lag[i]) op.pb(i);
	sort(all(op),[&](int x,int y) {
		return b[x]<b[y];
	});
	for (auto u:op) {
		if ((a[u]-b[u])%2!=0) return false;
		int d=(a[u]-b[u])/2;
		a[u]-=2*d;
		a[(u+1)%n]+=d;
		a[(u+n-1)%n]+=d;
		if (a[u]<max(a[(u+1)%n],a[(u+n-1)%n])-1) return false;
	}
	rep(i,0,n) if (a[i]!=b[i]) return false;
	return true;

}
int main() {
	scanf("%d",&n);
	rep(i,0,n) scanf("%d",&a[i]);
	rep(i,0,n) scanf("%d",&b[i]);
	puts(solve()?"Yes":"No");
}