Problem Statement

Max Gold Coins Collection Problem Description Max is on a quest to collect gold coins. He has come across a series of open carats that are filled with gold coins of varying quantities. He is free to collect the coins from any carat, however, as soon as he collects the coins from one carat, he gets a curse that makes him unable to collect coins from the adjacent carats. For example, if he collects coins from carat 'i', he cannot collect coins from carat 'i-1' or 'i+1'. Given a series of N carats and C numbers of gold coins inside each of them, write a program to help Max collect the maximum number M of gold coins. Input Format: The first line of input contains N, the number of carats. The second input line contains N numbers separated by a single white space, representing the number of gold coins in each carat. Output Format: The output contains M, the maximum number of gold coins Max can collect. Constraints I) 0 < N < 10 4 II) 0 <= C < 10 9 III) Number of gold coins in eac