시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 256 MB124766963.889%

## 문제

You want to have in your city a beatiful skyline. You have decided to build N skyscrapers in a straight row. The i-th of them should have exactly h[i] floors.

You have got offers from different construction companies. One of them offers to build one floor in any of the skyscrapers for 3 Million Euros. The other one offers to build one floor in each of two neighbouring skyscrapers for 5 Millions in total. Note that it doesn’t matter whether these floors are on the same height or not. The third one can build one floor in each of three consecutive skyscrapers for only 7 Millions.

You can build the floors in any order you want. Calculate the minimal possible total amount of money needed to finish the construction.

## 입력

The first line contains integer number N (1 ≤ N ≤ 300). The second line contains space separated N integer numbers, h[1], h[2], ..., h[N], 1 ≤ h[i] ≤ 200.

## 출력

Output one integer number: the amount of money, in Millions.

## 예제 입력 1

3
2 2 2


## 예제 출력 1

14


## 예제 입력 2

4
1 3 1 1


## 예제 출력 2

15