nOp1 dif = if dif>0 then 0 else (-dif`div`2)
nOp2 dif = if dif>0 then dif else (dif`mod`2)

solvable diff = nOp >= maximum [sum$map nOp1 diff, sum$map nOp2 diff]
 where nOp = -sum diff

compute a b = if solvable (zipWith (-) a b) then "Yes" else "No"

main = do
 n <- readLn :: IO Int
 x <- getLine
 let a = map read (words x) :: [Int]
 x <- getLine
 let b = map read (words x) :: [Int]
 putStrLn $ compute a b