# Dynamic Programming - Linear

# House Robber

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses are broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

#### Input

The first number contains the number of the houses **n** (**1** ≤ **n** ≤ `10`

). Second line contains ^{6}**n** integers `a`

, _{1}`a`

, ..., _{2}`a`

, where _{n}`a`

is the amount of money that can be robbed in the _{i}**i**-th house.

#### Output

Print the maximum amount of money you can rob tonight without alerting the police.

5 6 1 2 10 4

16