#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
using namespace std;
// #define debug(x) cout<<"[debug]"#x<<"="<<x<<endl
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const ld eps=1e-8;
const int INF=0x3f3f3f3f,mod=998244353;

#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define debug(...)
#include<debug>
#else
#define debug(...)
#endif

const int N=300005;
ld l[N];
ld r[N];
int n;
ld p[N];
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%Lf",&l[i]);
    for(int i=1;i<=n;i++) scanf("%Lf",&r[i]);
    p[1]=r[1];
    p[2]=l[2];
    for(int i=3;i<=n;i++)
    {
        p[i]=max(l[i],p[i-1]+(p[i-1]-p[i-2]));
        if(p[i]>r[i]+eps)
        {
            puts("No");
            return 0;
        }
        p[i-1]=min(r[i-1],p[i-2]+(p[i]-p[i-2])/2);
    }
    puts("Yes");
}