#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
 
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
 
using namespace std;
 
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
 
const int INF=1<<29;
const double EPS=1e-9;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int main(int argc, char const *argv[]) {
	
	int N;
	cin >> N;
	std::vector<int> score;
	std::vector<int> first;
	int now[101] = {0};
	for (int i = 0; i < N; ++i) {
		int temp;
		cin >>temp;
		score.push_back(temp);
	}


	for (int i = 0; i < N; ++i) {
		int temp;
		cin >> temp;
		first.push_back(temp);
	}


	int sum = 0;
	for (int i = 0; i < N; ++i) {
		if (first[i] == 0) {
			sum += score[i];
		} else {
			now[first[i]] += score[i];
		}
	}

	int ma = 0;
	for (int i = 0; i < 101; ++i) {
		ma = max(ma, now[i]);
	}

	if (sum >= ma) {
		cout << "YES" << endl;
	} else {
		cout << "NO" << endl;
	}





	return 0;
}