#include<iostream> #include<stdio.h> #include<algorithm> #include<vector> #include<string.h> #include<math.h> #include<map> #include<iomanip> #include<queue> const long long INF = 1e6+7; const long long MOD = 1e9+7; const double PI=acos(-1); using namespace std; int main(){ int n; cin >> n; vector<int> a(n,0),c(150,0); for(int i=0;i<n;i++){ cin >> a[i]; } for(int i=0;i<n;i++){ int id; cin >> id; c[id]+=a[i]; } int p=c[0]; sort(c.begin(),c.end(),greater<int>()); if(p>=c[0]){ cout << "YES" << endl; }else{ cout << "NO" << endl; } return 0; }