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

using namespace std;
using ll = long long;

struct Point {
    ll x, y;
};

ll arie(Point a, Point b, Point c) {
    return (a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y));
}

void solve() {
    int n;
    cin >> n;
    vector <int> L(n), R(n);
    for (int i = 0; i < n; i++) {
        cin >> L[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> R[i];
    }
    vector <Point> stiva;
    stiva.push_back({0, R[0]});
    for (int i = 1; i < n; i++) {
        while (stiva.size() >= 2 && arie(stiva[stiva.size() - 1], stiva[stiva.size() - 2], {i, R[i]}) >= 0) {
            stiva.pop_back();
        }
        stiva.push_back({i, R[i]});
    }
    int poz = 1;
    for (int i = 0; i < n; i++) {
        while (poz < stiva.size() && stiva[poz].x < i) {
            poz++;
        }
        if (arie(stiva[poz - 1], stiva[poz], {i, L[i]}) > 0) {
            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;
}