#include <bits/stdc++.h>

int main() {
    int n;
    std::cin >> n;
    std::vector<int> l(n), r(n), a(n);
    for (auto &x: l) {
        std::cin >> x;
    }
    std::vector<std::pair<int,int>> c;
    int t = 0;
    for (int i = 0; i < n; ++i) {
        std::cin >> r[i];
        int x = r[i];
        if (t >= 2 && (l[i] - c[t - 1].second) / (i - c[t - 1].first) <
                     (c[t - 1].second - c[t - 2].second) / (c[t - 1].first - c[t - 2].first)) {
            --t;
        }
        if (t >= c.size()) {
            c.emplace_back(i, x);
            ++t;
        } else {
            c[t++] = {i, x};
        }
    }
    //for (int i = 0; i < t; ++i) {
    //    std::cout << c[i].first << ' ' << c[i].second << '\n';
    //}
    int h = -1;
    for (int i = 0; i < n; ++i) {
        if (h + 1 < t && c[h + 1].first == i) {
            ++h;
            continue;
        }
        /// std::cout << h << ":\n";
        /// std::cout << c[h].first << ' ' << c[h].second << '\n';
        /// std::cout << c[h + 1].first << ' ' << c[h + 1].second << '\n';
        /// std::cout << i << ' ' << l[i] << '\n';
        if ((c[h + 1].second - l[i]) * (i - c[h].first) <
            (l[i] - c[h].second) * (c[h + 1].first - i)) {
            std::cout << "No\n";
            return 0;
        }
    }
    std::cout << "Yes\n";
    return 0;
}