#include <stdio.h>
#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

//216
int main() {
	int n, s[101], a[100], b[100];
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", a + i);
	for (int i = 0; i < n; i++)
		scanf("%d", b + i);

	for (int i = 0; i < n; i++)
		s[b[i]] += a[i];

	int ano = s[1];
	for (int i = 2; i <= 100; i++)
		ano = max(ano, s[i]);

	printf("%s\n", ano <= s[0] ? "YES" : "NO");
}