Elevator

直接开始上题目：

Problem Description

The highest building in our city has only one elevator. A request list is made up with N
positive numbers. The numbers denote at which floors the elevator will stop, in
specified order. It costs 6 seconds to move the elevator up one floor, and 4
seconds to move down one floor. The elevator will stay for 5 seconds at each stop.

For a given request list, you are to compute the total time spent to fulfill
the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.

我市最高的大楼只有一部电梯。请求列表由N个正数组成。数字表示电梯将按指定顺序停在哪个楼层。电梯上移一层需要6秒，下移一层需要4秒。电梯在每一站停留5秒钟

对于给定的请求列表，您需要计算完成列表中的请求所花费的总时间。电梯一开始在第0层，在满足要求时不必返回底层

Input

There are multiple
test cases. Each case contains a positive integer N, followed by N positive
numbers. All the numbers in the input are less than 100. A test case with N = 0
denotes the end of input. This test case is not to be processed.

有多个测试用例。每种情况都包含一个正整数N，后跟N个正数。输入的所有数字都小于100。N=0的测试用例表示输入的结束。不处理此测试用例。

Output

Print the total
time on a single line for each test case.

为每个测试用例在一行上打印总时间。

Sample Input

1 2

3 2 3 1

0

Sample Output

17

41