A special sweet shop has sweets in a circle, and each sweet make people happy in its own way. The rule is simple: you can't eat two sweets next to each other.

You are given an integer array sweets representing happiness factor in each sweet. Return maximum happiness factor you can have by eating the sweets following the rule of sweet shop.

Input Format:

Input contains an array of space separated integers $($keep reading integers till you get value in input$)$