There are n houses in a row. You cannot rob adjacent houses, and across the whole night you may rob at most one house marked as alarmed. Find the maximum total money.

First line: KaTeX can only parse string typed expression.
Second line: house values.
Third line: binary alarm flags.

Print the maximum obtainable money.