#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
int main(void){
	int n;
	int a[101]={0};
	int t;
	int c[101]={0};
	cin>>n;
	re(i,n) cin>>a[i];
	re(i,n){
		cin>>t;
		c[t]+=a[i];
	}
	if(c[0]==*max_element(c,c+n)) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;

	return 0;
}