#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int N;
    cin >> N;
    
    vector<int> S(N);
    vector<int> A(N);
    fill( A.begin(), A.end(), 0 );
    
    for ( int i = 0; i < N; i++ ) {
        cin >> S[i];
    } 
    for ( int i = 0; i < N; i++ ) {
        int n;
        cin >> n;
        A[n] += S[i];
    }
    int m = 0;
    for ( int i = 0; i < N; i++ ) {
        m = max( m, A[i] );
    } 
        
    cout << ( m == A[0] ? "YES": "NO" ) << endl;
    
    return 0;
}