Problem Statement  
A numerical sequence is called a palindrome if the reverse of the sequence is the same as the original. For example sequences {1, 2, 1}, {15, 78, 78, 15} and {112} are palindromes, but {1, 2, 2}, {15, 78, 87, 51} and {112, 2, 11} are not. You will be given a int[] sequence. You can replace any two adjacent numbers with their sum. Your method should return a minimal number of such operations required to make the given sequence a palindrome.  
Definition  
 
Constraints  
  sequence will contain between 1 and 50 elements, inclusive.  
  Each element of sequence will be between 1 and 10000, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
