import java.util.Scanner;
public class TheLargestSubarraySum {
public static void main(String[] args) {
TheLargestSubarraySum th = new TheLargestSubarraySum();
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = sc.nextInt();
}
int res = th.maxSubarray(nums);
System.out.println(“Maximum Subarray Sum: ” + res);
}
public int maxSubarray(int[] nums) {
int len = nums.length;
int[] dp = new int[len];
dp[0] = nums[0];
for (int i = 1; i < len; i++) {
if (dp[i-1] > 0){
dp[i] = dp[i-1] + nums[i];
}else{
dp[i] = nums[i];
}
}
int res = dp[0];
for (int i = 1; i < len; i++) {
res = Math.max(res,dp[i]);
}
return res;
}
}