Santa visited you night, he had chocolates. Each chocolate fills your heart with some amount of happiness.
The th chocolate fills your heart with happiness.
He placed the chocolates in front you in a table in this order -
1 (a_1) ,2 (a_2) ,3 (a_3)... n (a_n)
So Santa told you that you can choose as many chocolates you want to have but you cannot choose consecutive chocolates. (If you choose th chocolate then you cannot choose th chocolate or th chocolate)
The total happiness is the sum of happiness of the choosen chocolates.
So obviously you want to maximize your total happiness.
So you are given n = 14
This problem is a part of Tessellate S.T.E.M.S.