原题：

Elevator

 1000ms  32768K

描述：

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.

输入：

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.

输出：

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

样例输入：

1 2
3 2 3 1
0

样例输出：

17
41
（链接：Elevator | JXNUOJ）

翻译：

电梯

我们城市最高的建筑只有一台电梯。一个要求清单由N个正整数组成。这些数字代表在特定的命令下电梯将停的楼层。电梯上一层楼花费6秒的时间，下一层楼花费4秒。每次停下将停留5秒。对于一张要求清单，你要计算完成清单上的所有要求总共花费的时间。电梯从第0层开始并且当所有要求被完成没有必要回到地面。

输入：

有多组测试数据，每一行包括一个正整数N，后面N个正整数。所有输入数字少于100.一组测试数据N=0代表输入结束。这组测试数据不用输出结果。

输出：

输出总时间，每行对应一个测试数据。