You are a professional robber planning to rob houses along a street. All houses are arranged in a circle. That means the first house is the neighbor of the last one. Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input:  2 3 2
Output: 3

Example 2:

Input:  1 2 3 1
Output: 4

Constraints:

• 1 ≤ nums.length ≤ 100
• 0 ≤ nums[i] ≤ 1000

Input format: Space-separated integers.

Output format: Maximum amount.