Sweetest Candy

Chef wants to buy candy for his friend. He went to a store which sells candies from $N$ jars, arranged in a circle and numbered $1$ through $N$ in such a way that for each valid $i$, jars $i$ and $i+1$ are adjacent, and jars $1$ and $N$ are also adjacent. For each valid $i$, the candies in the $i$-th jar have a sweetness $A_i$. Obviously, Chef wants to buy the sweetest candies. However, he gets