k = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
def possible():
if sum(a) != sum(b):
return False
# c[i] = скільки людей віддали хоча б i яблук
c = [0] * (k + 2)
for v in a:
c[v] += 1
for i in range(k - 1, -1, -1):
c[i] += c[i + 1]
b.sort(reverse=True)
# cur = (c[1] + ... + c[i]) - (b_1 + ... + b_i)
cur = 0
for i in range(1, k + 1):
cur += c[i] - b[i - 1]
if cur < 0:
return False
return True
if possible():
print("Yes")
else:
print("No")
