will rate if done in python

You are given an array of integers, which may be positive or negative (or zero). Find the maximum possible total sum of a consecutive subsequence of numbers An example with an array of length 8 follows: Starting at index i -2 we can see we have a subarray length 4 with j - 5 consisting of: 4-1 3 2 which sums to 8. This is the largest sum of any subsequence. Notice we are required to take the -1 in this subsequence as we are only interested in finding the maximum total sum of consecutive subsequences Input The first line consists of an integer n. 1<>