House Robber I

easy⏱ 2s limit💾 64 MB

Description

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 systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Find the maximum money you can rob tonight without alerting the police.

Input Format

First line contains array size N.

Second line contains N space-separated integers representing money in each house.

Output Format

Print the max money.