#include <bits/stdc++.h>
#include <atcoder/all>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using pll=pair<ll,ll>;

using mint=modint;

template<class K,class V>
using ordered_map=tree<K,V,less<K>,rb_tree_tag,tree_order_statistics_node_update>;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
    
    ll N;
    cin>>N;
    vll a(N+1,0),b(N+1,0),score(101,0);
    for(int i=1;i<=N;++i)cin>>a[i];
    for(int i=1;i<=N;++i)cin>>b[i];
    for(int i=1;i<=N;++i)score[b[i]]+=a[i];

    if(max_element(score.begin(),score.end())==score.begin())cout<<"YES\n";
    else cout<<"NO\n";
}