#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n, L[N], R[N];

bool chk(int x,int y,int z)
{
    return 1ll*(R[z]-R[y])*(y-x)<(R[y]-R[x])*(z-y);
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", L + i);
    for (int i = 1; i <= n; ++i) scanf("%d", R + i);
    vector<int>st;
    for(int i=1;i<=n;i++)
    {
        while(st.size()>1&&chk(st[st.size()-2],st[st.size()-1],i))
            st.pop_back();
        st.push_back(i);
    }
    bool ok=1;
    for(int i=0;i+1<st.size();i++)
        for(int j=st[i];j<=st[i+1];j++)
        {
            int l=st[i],r=st[i+1];
            ok&=(1ll*(L[j]-R[l])*(r-l)<=1ll*(j-l)*(R[r]-R[l])&&1ll*(j-l)*(R[r]-R[l])<=1ll*(R[j]-R[l])*(r-l));
        }
    puts(ok?"Yes":"No");
    return 0;
}