Minimum Cost For Tickets

medium

1. You are going on a vacation for a year, you've decided certain days for travelling in the city, given to you as a strictly increasing array from day 1....365
 2. There are 3 kinds of passes you can take in this city for transport: 
     a) A single day pass, cost of which is in an array at cost[0]
     b) A week's pass, cost of which  is in an array at cost[1]
     c) A month's pass, cost of which  is in an array at cost[2]
 3. Find and return minimum amount it'll cost you for travelling in the city according to the given days
 4. Input and output is handled for you
 5. It is a functional problem ,please do not modify main()

Input Format

Input is handled for you

Output Format

Output is handled for you

Constraints

array contains strictly increasing positive integers
 1&lt;=Days.length &lt;=365
 1&lt;=Days[i]&lt;=365

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

9
2 3 8 9 10 11 12 14 27
1 5 25

Output

Minimum Ascii Delete Sum For Two Strings

Minimum Cost To Make Two Strings Identical