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

#include <stdio.h>

/* 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) {
    FILE *input_file;
    FILE *output_file;
    int i;

    /* Open the input and output files. */
    input_file = fopen("tspin.txt", "r");
    output_file = fopen("tspout.txt", "w");

    /* Read the value of N. */
    fscanf(input_file, "%d", &N);

    /* Read the values of L and R. */
    for (i = 0; i < N; i++) {
        fscanf(input_file, "%d", &L[i]);
    }
    for (i = 0; i < N; i++) {
        fscanf(input_file, "%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.
     */

    fprintf(output_file, "YES\n");

    /* Finally, close the input/output files. */
    fclose(input_file);
    fclose(output_file);

    return 0;
}