#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 300005;
typedef pair<int, int> pi;

ll operator ^ (pi x, pi y) {
    return 1ll * x.first * y.second - 1ll * x.second * y.first;
}

int l[N], r[N];
pi a[N];

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i)
        cin >> l[i];
    for (int i = 0; i < n; ++i)
        cin >> r[i];
    for (int i = 1; i < n; ++i)
        a[i - 1] = pi(1, r[i] - r[i - 1]);
    vector<pi> v;
    for (int i = 0; i < n - 1; ++i) {
        while (!v.empty() && (v.back() ^ a[i]) < 0) {
            a[i].first += v.back().first;
            a[i].second += v.back().second;
            v.pop_back();
        }
        v.push_back(a[i]);
    }
    int x1 = 0, y1 = r[0];
    for (auto [x, y] : v) {
        int x2 = x1 + x, y2 = y1 + y;
        for (int i = x1 + 1; i <= x2; ++i) {
            if ((y2 - y1) < 1ll * (l[i] - y1) * (x2 - x1))
                return cout << "No\n", 0;
        }
        x1 = x2, y1 = y2;
    }
    cout << "Yes\n";
}