# Buy And Sell Stocks - Two Transactions Allowed

easy

1. You are given a number n, representing the number of days. 2. You are given n numbers, where ith number represents price of stock on ith day. 3. You are required to print the maximum profit you can make if you are allowed two transactions at-most. Note - There can be no overlapping transaction. One transaction needs to be closed (a buy followed by a sell) before opening another transaction (another buy).

## Constraints

0 <= n <= 20 0 <= n1, n2, .. <= 10

## Format

### Input

A number n .. n more elements

### Output

A number representing the maximum profit you can make if you are allowed a single transaction.

## Example

Sample Input

9
11
6
7
19
4
1
6
18
4

### Sample Output

30

Question Video