#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
#include<unordered_map>
#include<unordered_set>
using namespace std;
int n;
#define MAX 102
int a[MAX];
int v[MAX];
int main(){
	scanf("%d", &n);
	for (int i = 0; i < n; i++){
		scanf("%d", &a[i]);
	}
	int sum = 0;
	for (int i = 0; i < n; i++){
		int b;
		scanf("%d", &b);
		if (b == 0){
			sum += a[i];
		}
		else{
			v[b] += a[i];
		}
	}
	sort(v, v + MAX);
	reverse(v, v + MAX);
	if (sum >= v[0]){
		puts("YES");
	}
	else{
		puts("NO");
	}
	return 0;
}