/*
 * Solution Template for TSP
 * 
 * Australian Informatics Olympiad 2022
 * 
 * This file is provided to assist with reading of input and writing of output 
 * for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <cstdio>

/* N is the number of days. */
int N;

/* L contains the minimum number of tomatoes you must sell each day. */
int L[100005];

/* R contains the maximum number of tomatoes you must sell each day. */
int R[100005];

int main(void) {
    /* Read the value of N. */
    scanf("%d", &N);

    /* Read the values of L and R. */
    for (int i = 0; i < N; i++) {
        scanf("%d", &L[i]);
    }
    for (int i = 0; i < N; i++) {
        scanf("%d", &R[i]);
    }

    /*
     * TODO: This is where you should compute your solution. You should output
     * YES or NO depending on whether it is possible to meet the requirements.
     * An example of how to output YES is shown below.
     */

    printf("YES\n");

    return 0;
}