#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <ctime>
#include <random>
#include <cassert>

using namespace std;
using ll = long long;

void solve() {
    int n;
    cin >> n;
    vector <pair <ll, ll>> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i].first;
    }
    for (int i = 0; i < n; i++) {
        cin >> v[i].second;
    }
    for (int i = 2; i < n; i++) {
        ll x = 2 * v[i - 1].first - v[i - 2].second;
        v[i].first = max(v[i].first, x);
        if (v[i].first > v[i].second) {
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
}

signed main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int nrt = 1;
    //cin >> nrt;
    while (nrt--) {
        solve();
    }
    return 0;
}