1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

typedef unsigned long long u64;

int n,x,len,ext;
ll ans;
u64 hd,pw[22];
int main() {
	scanf("%d",&n);
//	n=200000;
	pw[0]=1;
	rep(i,1,19) pw[i]=pw[i-1]*10;
	bool faq=0;
	u64 num=0;
	rep(i,0,n) {
		scanf("%d",&x);
//		x= 1 + ((i * 1ll * i) ^ i ^ (i + 17)) % 500;

		if (!faq) {
			int clen=0;
			u64 w=x;
			if (w<=num) {
				while (w<=num) {
					w=w*10;
					clen++;
				}
				w/=10;
				clen--;
				if (w+pw[clen]-1>num) {
					num=max(num+1,w);
				} else {
					num=w*10;
					clen++;
				}
			} else {
				num=x;
				clen=0;
			}
			ans+=clen;
			if (num>=pw[18]) {
				faq=1;
				hd=x;
				len=clen;
				ext=num-hd*pw[len];
			}
		} else {
			u64 w=x;
			while (hd<x) {
				hd=hd*10;
				len--;
			}
			int clen=len;
			u64 ww=x+1;
			while (w<=hd) w=w*10,ww=ww*10,clen++;
			w/=10; ww/=10; clen--;
			if (w<=hd&&hd<ww) {
				ext++;
			} else {
				hd=x;
				clen++;
				len=clen;
				ext=0;
			}
			ans+=clen;
//			printf("%llu %d %d\n",hd,len,ext);
		}
	}
	printf("%lld\n",ans);
}