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
#include "bits/stdc++.h"

using namespace std;
#define PB push_back
#define LL long long
#define int LL
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define VI vector<int>
#define PII pair<int,int>
#define LD long double

template<class C> void mini(C& a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream &os, vector<T> V){
  os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]";
} 

template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}


#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

int digits(int a){
  int co = 0;
  do{
    co++;
    a /= 10;
  } while(a);
  return co;
}

int32_t main(int32_t, char ** argv) {
  //1. dofaszerujmy 0 do pierwszej liczby
  //jak rowne to zwiekszamy prawo
  //jak mniejsza to musimy dopisac 0
  //jak wieksza to zmieniamy wszystko na prawo na 0

  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin>>n;
  int last = 0;
  int res = 0;
  int remaining = n;
  VI pot10(19, 10);
  pot10[0] = 1;
  partial_sum(ALL(pot10), pot10.begin(), multiplies<int>());

  int left, right;
  int total_digits;

  REP(i, n){
    int cur;
    cin>>cur;
    last++;
    remaining--;

    int last_digits = digits(last);
    int cur_digits = digits(cur);
    int diff_digits = max(0LL, last_digits - cur_digits);

    int pref_of_last = last / pot10[diff_digits];
    if(pref_of_last == cur){
      res += diff_digits;
    } else if(pref_of_last < cur){
      res += diff_digits;
      last = cur * pot10[diff_digits];
    } else if(pref_of_last > cur){
      res += diff_digits + 1;
      last = cur * pot10[diff_digits + 1];
    }
    //debug(last);
    if(last >= 1e17){
      assert(last % pot10[6] == 0);
      left = last;
      right = 0;
      total_digits = digits(last);
      break;
    }
  }

  REP(i, remaining){
    int cur;
    cin>>cur;
    right++;
    int left_digits = digits(left);
    int cur_digits = digits(cur);
    REP(_, cur_digits - left_digits){
      left *= 10;
    }
    left_digits = digits(left);
    int diff_digits = max(0LL, left_digits - cur_digits);
    int pref_of_last = left / pot10[diff_digits];

    if(pref_of_last == cur){

    } else if(pref_of_last < cur){
      left = cur;
      right = 0;
    } else{
      left = cur;
      right = 0;
      total_digits++;
    }
    res += total_digits - cur_digits;
  }
  cout<<res<<"\n";
}