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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
//Michal Maras
//Who enters to my domain?
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <iomanip>
#include <sstream>
#include <string>
#include <bitset>
#include <vector>
#include <random>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <assert.h>

#define BOOST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define SIZE(x) (int)(x.size())
#define MP(x, y) make_pair(x, y)
#define PB(x) push_back(x)
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define ALL(a) (a).begin(), (a).end()

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned int UINT;

#define INF 2000000007
#define LLINF 2000000000000000007

using namespace std;

template <typename t1, typename t2>
istream& operator>> (istream& in, pair<t1, t2> &p)
{
	in >> p.first >> p.second;

	return in;
}

template <typename t1, typename t2>
ostream& operator<< (ostream& out, pair<t1, t2> &p)
{
	out << p.first << " " << p.second;

	return out;
}

template <typename t>
ostream& operator<< (ostream& out, vector <t> &v)
{
	for (auto& i : v)
	{
		out << i << "\n";
	}

	return out;
}

/*template <typename T>
T GenRandom(T min, T max)
{
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<T> dist(min, max);

return dist(gen);
}
*/

#define fin(s) freopen(s, "r", stdin)

// --------------- CODE -------------- //
string previous;

void addOne()
{
	int id = SIZE(previous) - 1;

	++previous[id];

	while (previous[id] > '9' && id != 0)
	{
		previous[id] = '0';
		--id;
		++previous[id];
	}
}

void clearPrev()
{
	FOR(i, 0, min(SIZE(previous), 9))
	{
		previous[i] = '0';
	}

	for (int j = SIZE(previous) - 1; j >= max(0, SIZE(previous) - 8); --j)
	{
		previous[j] = '0';
	}
}

int main()
{
	BOOST;

	int n;

	cin >> n;

	LL result = 0;

	FOR(i, 0, n)
	{
		string a;

		cin >> a;

		if (SIZE(a) > SIZE(previous))
		{
			previous = a;
			continue;
		}

		int bigger = 0;

		FOR(i, 0, SIZE(a))
		{
			if (a[i] != previous[i])
			{
				if (a[i] < previous[i])
				{
					bigger = -1;
				}
				else
				{
					bigger = 1;
				}

				break;
			}
		}

		if (bigger == -1)
		{
			clearPrev();

			FOR(i, 0, SIZE(a))
			{
				previous[i] = a[i];
			}

			previous.PB('0');
		}
		else if(bigger)
		{
			clearPrev();

			FOR(i, 0, SIZE(a))
			{
				previous[i] = a[i];
			}
		}
		else
		{
			addOne();

			bool err = false;

			FOR(i, 0, SIZE(a))
				{
					if (a[i] != previous[i])
					{
						err = true;
						break;
					}
				}

			if (err)
			{
				clearPrev();

				FOR(i, 0, SIZE(a))
				{
					previous[i] = a[i];
				}

				previous.PB('0');
			}
		}

		result += SIZE(previous) - SIZE(a);
	}

	cout << result;

	return 0;
}