#include<cstdio>
#include<string>
#include<iostream>
#include<vector>
#include <algorithm>//fill()在里面
#include <cmath>
using namespace std;
//A1008 :数学问题
const int INF=1e9;
const int maxn=110;
int seq[maxn];//存放电梯停放的序列
int main(){
int n,sum=0;
cin>>n;
//给出的n个数字都是电梯要停的楼层:数字应该不会重复
seq[0]=0;//最开始停在0层
for(int i=1;i<=n;i++){
cin>>seq[i];
}
for(int i=0;i<=n-1;i++){
int differ=seq[i+1]-seq[i];
// cout<<differ<<endl;
if(differ<0){
differ=-differ;
sum=sum+4*differ;
}else{
sum+=differ*6;
}
}
sum+=n*5;
cout<<sum<<endl;
return 0;
}