#include <bits/stdc++.h>
using namespace std;
using db = long long;
const int N = 3e5 + 50;

int n;
db L[N], R[N];
using point=pair<db,db>;
point operator+(point a,point b){return {a.first+b.first,a.second+b.second};}
point operator-(point a,point b){return {a.first-b.first,a.second-b.second};}
db operator^(point a,point b){return a.first*b.second-a.second*b.first;}
using VP=vector<point>;
int dcmp(const db a){return abs(a)==0?0:(a<0?-1:1);}

VP p;

bool isonseg(point sl,point sr,point tl,point tr){
    return (dcmp((sr-tl)^(tr-tl))*dcmp((sl-tl)^(tr-tl))<=0)&&(dcmp((tr-sl)^(sr-sl))*dcmp((tl-sl)^(sr-sl))<=0);   
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    cin >> n;
    p.resize(n + 5);
    for (int i =1;i<=n;i++) cin >> L[i];
    for (int i =1;i<=n;i++) cin >> R[i];
    for (int i =1;i<=n;i++)p[i]=point(i,R[i]);
    vector<int> st;
    for (int i = 1; i <= n; i++) {
        while(st.size() > 1 && dcmp((p[st.back()]-p[*(st.rbegin()+1)])^(p[i]-p[*(st.rbegin()+1)]))<=0)
            st.pop_back();
        st.push_back(i);
    }

    for (int i = 0; i+1<st.size();i++) {
        point sl=p[st[i]],sr=p[st[i+1]];
        for (int j = st[i]; j <= st[i + 1]; j++) {   
            point tl=point(j,L[j]),tr=point(j,R[j]);
            if (!isonseg(sl,sr,tl,tr)) {
                cout << "No\n";
                return 0;
            }
        }
    }
    cout << "Yes\n";
    return 0;
}