#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;
#define N 200
int a[N], b[N], c[N];

int main(){
	int n;
	cin>>n;
	for(int i = 0; i < n; i++) cin>>a[i];
	for(int i = 0; i < n; i++) cin>>b[i];
	for(int i = 0; i < n; i++) c[b[i]] += a[i];
	int mx = c[0];
	for(int i = 0; i < N; i++) mx = max(mx, c[i]);
	cout<<(mx==c[0]?"YES":"NO")<<endl;
	return 0;
}