First and Last

You are given an array $A = [A_1, A_2, \ldots, A_N]$ of length $N$. You can right rotate it any number of times (possibly, zero). What is the maximum value of $A_1 + A_N$ you can get? **Note:** Right rotating the array $[A_1, A_2, \ldots, A_N]$ once gives the array $[A_N, A_1, A_2, \ldots, A_{N-1}]$. For example, right rotating $[1, 2, 3]$ once gives $[3, 1, 2]$, and right rotating it again give