#include "bits/stdc++.h"
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;
#define int long long
 
#define dbg_loc() cerr << __PRETTY_FUNCTION__ << " : " << __LINE__ << "\n"
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p){ 
	return os << '(' << p.first << ", " << p.second << ')'; 
}
template<typename T_container,typename T=typename enable_if<!is_same<T_container,string>::value, typename T_container::value_type>::type> 
ostream& operator<<(ostream &os, const T_container &v){ 
	os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; 
}
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ 
	cerr << ' ' << H; 
	dbg_out(T...); 
}
#define LOCAL
#define LOCAL
#ifdef LOCAL 
#define dbg(...) cerr<<"(" << #__VA_ARGS__<<"):" , dbg_out(__VA_ARGS__) , cerr << endl
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll mod = (1000000007LL);
inline ll Mod(ll a, ll b){return (a%b);}
inline ll poww(ll a, ll b){ll res = 1;while (b > 0){if(b & 1) res = (res * a)%mod;a = (a * a)%mod;b >>= 1;}return res;}
ll gcd (ll a, ll b) { while (b) { a %= b,swap(a, b);}return a;}
void read(vector<int> &w, int n){w.resize(n);for(int i = 0; i < n; i++) cin>>w[i];}
void print(vector<int> &w){for(int i =0; i < sz(w); i++){if(i == sz(w) - 1) cout<<w[i]<<"\n";else cout<<w[i]<<" ";}}
 
///CUIDADO COM MAXN
#define N 1000010 // 1E6
 
int n, m, q, k, v[N];
pii w[N];
int L[N],R[N];
int cross(pii O, pii A, pii B){
	return (A.f-O.f)*(B.s-O.s) - (A.s-O.s)*(B.f-O.f);
}
void solve_case(){
	cin>>n;
	vector<pii> caras;
	rep(i,1,n+1) cin>>L[i];
	vector<pii> pilha; int t=0;
	rep(i,1,n+1){
		cin>>R[i];
		while(sz(pilha) >= 2 and cross(pilha[t-1],{i,R[i]}, pilha[t-2]) < 0) pilha.pop_back(),--t;
		pilha.pb({i,R[i]});
		++t;
	}
	vi delta(n+1);
	rep(i,1,n+1){
		auto it = upper_bound(all(pilha), pii(i,0)); // primeira posicao >= i
		if( (*it).f == i){
			continue;
		}
		else{
			auto old = prev(it);
			pii a = *old, b = *it;
			double slope = (b.s - a.s)/(b.f - a.f);
			double y = slope*(i-a.f) + a.s;
			if(y < L[i]){
				cout<<"No\n";
				return;
			}
		} 
	}
	cout<<"Yes\n";
}
 
int32_t main(){
	ios::sync_with_stdio(false); cin.tie(0);
	
	int test_case=1;
	// cin>>test_case;
	while(test_case--){
		solve_case();
	}
}