You are given an array A consisting of $N$ numbers. In one move you can delete either the first two, the last two, or the first and last elements of A$.$ No move can be performed if the length of $A$ is smaller than $2.$ The result of each move is the sum of the deleted elements.

Write a function:

def solution$(A)$

that, given an array $A$ of $N$ integers, returns the maximum number of moves that can be performed on A$,$ such that all performed moves have the same result.

Examples:

Given $A=[3,1,5,3,3,4,2],$ the function should return $3.$ The first move should delete two last elements $(4$ and $2$ with sum $=6),$ then $A=[3,1,5,3,3].$ The second move may delete first and last elements $(3$ and $3$ with sum $=6),$ then $A=[1,5,3].$ The third move should delete first two elements $(1$ and $5$ with sum $=6),$ then $A=[3].$

Given $A=[4,1,4,3,3,2,5,2],$ the function should return $4.$ It is possible to delete the first and last elements four times, as each