#include<iostream>
#include<list>
#include<stdio.h>
#include<map>
#include<set>
using namespace std;
#define ull unsigned long long int
#define FOR(i,n) for(int i=0;i<(n);++i)
#define FORI(i,start,n) for(int i=(start);i<(n);++i)
#define nil 5000
#define znakow 26
#define DEBUG 0
#define dcout DEBUG && cout
int inline min(int a,int b){return a>b?b:a;}
int inline max(int a,int b){return a<b?b:a;}
int leng(int n){
    int r=1;
    while(n/=10)++r;
    return r;
}
int dig(int n, int k){
    int d=leng(n);
    FOR(i,d-k-1)n/=10;
    return n%10;
}
class N
{
	public:
	N(int k){
	    prefixLen=leng(k);
	    prefix = new char[prefixLen];
	    int digit=prefixLen;
	    while(digit){prefix[--digit]=(k%10);k/=10;}
	    zeros=0;
	    increment=0;
	    incrementLength=0;
	}
	N(N*n){
	    prefixLen=n->prefixLen;
	    prefix = new char[prefixLen];
	    FOR(i,prefixLen)
	        prefix[i]=n->prefix[i];
	    zeros=n->zeros;
	    increment=n->increment;
	    recalculateIncrementLength();
	}
		char* prefix;
		int prefixLen;
		int zeros;
		int increment, incrementLength;
		void recalculateIncrementLength(){
	        incrementLength = min(leng(increment), zeros);
		}
		int len(){
		    return prefixLen+zeros;
		}
		int isLessThen(N*o){
		    int prefixes = max(this->prefixLen, o->prefixLen);
		    FOR(i,prefixes){
		        int td =this->digit(i);
		        int od = o->digit(i);
		        if(td<od)return 1;
		        if(td>od)return 0;
		    }
		    int tf=max(this->len() - this->incrementLength, prefixes);
		    int of=max(o->len() - o->incrementLength, prefixes);
		    int f=min(tf,of);
		    FORI(i, f, len()){
		        int td =this->digit(i);
		        int od = o->digit(i);
		        if(td<od)return 1;
		        if(td>od)return 0;
		    }
		    return 0;
		}
		int digit(int n){
		    if(n<prefixLen)
		        return prefix[n];
		    if(n<prefixLen+zeros-incrementLength)
		        return 0;
		    return dig(increment, n-prefixLen-(zeros-incrementLength));
		}
		void expand(int newLength){
		    zeros = newLength - prefixLen;
		    recalculateIncrementLength();
		}
		N*makeGreaterThan(N*current){
		    FOR(i,this->prefixLen){
		        int td=this->digit(i);
		        int cd=current->digit(i);
		        if(td<cd){
		            //dcout<<"the new prefix is less then current, so just add enough zeros, so length is one more than previous"<<endl;
		            return this->newExpanded(current->len()+1);
		        }
		        if(td>cd){
		            //dcout<<"the new prefix is more then current, so just add enough zeros"<<endl;
		            return this->newExpanded(current->len());
		        }
		    }
	        // new prefix, thus whole number is a prefix to old one
	        if(this->len()==current->len()){
	            //dcout<<"numbers are equal"<<endl;
	            return this->newExpanded(current->len()+1);
	        }
	        // prefix reminder, zeros, increment
	        if(this->prefixLen<current->prefixLen){
	            //dcout<<"there is a prefix reminder"<<endl;
	            if(current->canIncreaseIncrease()){
	                //dcout<<"there is a prefix reminder, can increaseIncrease"<<endl;
	                return current->increaseIncrease();
	            }
	            if(current->canIncreaseReminder(this->prefixLen)){
	                //dcout<<"can increase prefix reminder"<<endl;
	                return current->increaseReminder();
	            }
	            //dcout<<"just expanding next"<<endl;
	            return this->newExpanded(current->len()+1);
	        }
	        //dcout<<"there is no prefix reminder"<<endl;
	        if(current->canIncreaseIncrease(this->prefixLen)){
	            //dcout<<"can just increaseIncrease"<<endl;
	            return current->increaseIncrease();
	        }
	        //dcout<<"no prefix reminder and can not increase Increase"<<endl;
	        return this->newExpanded(current->len()+1);
		}
		N*newExpanded(int length){
            N*r=new N(this);
            r->expand(length);
            return r;
		}
		N*increaseReminder(){
            N*r=new N(this);
            int lastDigit = r->prefixLen-1;
            r->prefix[lastDigit]+=1;
            while(prefix[lastDigit]==10){
                prefix[lastDigit]=0;
                --lastDigit;
                ++prefix[lastDigit];
            }
            r->increment=0;
            r->recalculateIncrementLength();
            return r;
		}
		int canIncreaseReminder(int n){
		    FORI(i,n,this->prefixLen)if(this->prefix[i]!=9)return 1;
		    return 0;
		}
		N*increaseIncrease(){
            N*r=new N(this);
            r->increment+=1;
            r->recalculateIncrementLength();
            return r;
		}
		int canIncreaseIncrease(){
		    return leng(increment+1)<=zeros;
		}
		int canIncreaseIncrease(int n){
		    if(!canIncreaseIncrease())return 0;
		    if(n>=this->len())return 0;
		    int length = this->len();
		    for(int i=length-1;n<=i;--i){
		        if(digit(i)!=9)return 1;
		    }
		    return 0;
		}
		~N(){
		    delete prefix;
		}
		char*toString(){
		    char*c=new char[len()+1];
		    FOR(i,len())c[i]=digit(i)+'0';
		    c[len()]=0;
		    return c;
		    FOR(i,prefixLen){
		        c[i]=prefix[i]+'0';
		    }
		    FOR(i,zeros-incrementLength){
		        c[prefixLen+i]='0';
		    }
		    int h=prefixLen+zeros-incrementLength;
		    int ii=increment;
	        int last=incrementLength;
		    while(last){c[h+(--last)]=(ii%10)+'0';ii/=10;}
		    c[len()]=0;
		    return c;
		}
};
N*inc(N*current, N*next){
    if(current->len()<next->len())
        return new N(next);
    if(current->len()==next->len()){
        if(current->isLessThen(next))
            return new N(next);
    }
    return next->makeGreaterThan(current);
}
int main(){
    ios::sync_with_stdio(false);
	int n;
	cin>>n;
	N*current=new N(0);
	ull d=0;
	FOR(i,n){
	    int k;
	    cin>>k;
	    N*next=new N(k);
	    N*newNext = inc(current, next);
	    //dcout<<"was "<<next->toString()<<" is: "<<newNext->toString()<<" len: "<<(newNext->len())<<" zeros: "<<(newNext->zeros)<<" inc: "<<(newNext->increment)<<endl;
	    d+=newNext->len()-next->len();
	    delete current;
	    current = newNext;
	    delete next;
	}
	cout<<d<<endl;
    return 0;
}