Print Pascal's triangle up to N rows.

Difficulty: Hard

Phase: 6 · Mixed Logical Challenges

XP Reward: 30 XP

Topics: Mixed Logical Challenges, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given N integers, find the contiguous subarray within the array which has the largest product. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 4 2 3 -2 4

Output: 6

Explanation: Sample execution for input 4 2 3 -2 4