Taco Crate Fulfillment

You are given the number of different items and two lists: one representing the number of crates requested for each item by various stations and the other representing the number in stock for each item. Your task is to determine if every request can be completely met by the available stock. For each item, if the number of crates requested is less than or equal to the number in stock, the request is fulfilled; otherwise, it is not.

The problem can be formally described as follows. Given an integer \( n \) and two sequences \( r_1, r_2, ..., r_n \) and \( s_1, s_2, ..., s_n \), where \( r_i \) represents the requested crates and \( s_i \) represents the available stock for the \( i\)th item, output "Yes" if \( r_i \leq s_i \) for all \( i \) (\( 1 \leq i \leq n \)); otherwise, output "No".

inputFormat

The input is given from standard input (stdin) and has the following format:

1. The first line contains an integer \( n \) representing the number of different items.
2. The second line contains \( n \) space-separated integers representing the number of crates requested for each item.
3. The third line contains \( n \) space-separated integers representing the number of crates in stock for each item.

outputFormat

Print a single line to standard output (stdout) containing "Yes" if every request can be fulfilled with the available stock, otherwise print "No".

3
5 10 7
6 10 8

Yes