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
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n;
ll a, b, f, da, db, out, tail;

ll digits (ll x){
	ll res;
	for (res=1; x>=10; res++)
		x/=10;
	return res;
	}

ll face (ll x, int k)
	{
	k=digits(x)-k;
	while (k--)
		x/=10;
	return x;
	}

void pump (ll& x, int k){
	while (k--) x*=10, out++;
	}

void solve1 ()
	{
	scanf ("%lld",&b);
	if (b>a)
		{
		a=b;
		return;
		}
	da=digits(a);
	db=digits(b);
	f=face(a,db);
	if (b > f)
		{
		pump(b, da-db);
		a=b;
		return;
		}
	if (b < f)
		{
		pump(b, da-db+1);
		a=b;
		return;
		}
	if (b == f)
		{
		if (face(a+1, db)==b)
			{
			out+=da-db;
			a++;
			}
		else
			{
			pump(b, da-db+1);
			a=b;
			}
		}
	}

void solve2 ()
	{
	scanf ("%lld",&b);
	da=10;
	db=digits(b);
	f=face(a,db);
	if (b == f)
		out+=da-db;
	else
		{
		if (b < f)
			tail++;
		pump(b, da-db);
		a=b;
		}
	out+=tail;
	}

int main ()
	{
	scanf ("%d",&n);
	while (n > 0)
		{
		solve1();
		n--;
		if (digits(a)>=18)
			break;
		}
	if (n>0)
		{
		tail = 8;
		a = face(a,10);
		while (n > 0)
			{
			solve2();
			n--;
			}
		}
	printf ("%lld\n",out);
	return 0;
	}