#include <bits/stdc++.h>

using namespace std;

long long n, m=15, h;
long long t[200001];
long long d[200001];
long long k[200001];
long long l[200001];
long long p[200001];
long long w;

int xd(int a)
{
    int g=0;
    while(a>9)
    {
        ++g;
        a/=10;
    }
    return g;
}

long long ma(long long xdd, long long xxd)
{
    if(xxd>xdd)
    {
        return xxd;
    }
    return xdd;
}

long long mi(long long xdd, long long xxd)
{
    if(xxd<xdd)
    {
        return xxd;
    }
    return xdd;
}

long long p10(long long a)
{
    long long b=1;
    while(a>0)
    {
        b*=10;
        --a;
    }
    return b;
}

int main()
{
    scanf("%lld", &n);
    for(int i=1; i<=n; ++i)
    {
        scanf("%lld", &t[i]);
        p[i]=t[i];
        if(m>xd(t[i]))
        {
            m=xd(t[i]);
        }
    }
    for(int i=1; i<=n; ++i)
    {
        h=1;
        while(xd(t[i])>m)
        {
            ++d[i];
            l[i]+=t[i]%10*h;
            h*=10;
            t[i]/=10;
        }

    }
    //printf("%lld %lld %lld %lld %lld\n", p[1], t[1], d[1], l[1], k[1]);
    for(int i=2; i<=n; ++i)
    {
        if(t[i]>t[i-1])
        {
            if(d[i]<d[i-1]+k[i-1])
            {
                k[i]=d[i-1]+k[i-1]-d[i];
                l[i]=0;
                w+=k[i];
            }
        }
        else
        {
            if(t[i]<t[i-1])
            {
                if(d[i]<=d[i-1]+k[i-1])
                {
                    k[i]=d[i-1]+k[i-1]-d[i]+1;
                    l[i]=0;
                    w+=k[i];
                }
            }
            else
            {
                if(d[i]<d[i-1]+k[i-1])
                {
                    if(k[i-1]==0)
                    {
                        if(xd(l[i-1]+1)==d[i-1])
                        {
                            k[i]=d[i-1]-d[i]+1;
                            w+=k[i];
                        }
                        else
                        {
                            k[i]=d[i-1]-d[i];
                            l[i]=l[i-1]+1;
                            w+=k[i];
                        }
                    }
                    else
                    {
                        if(d[i]<d[i-1])
                        {
                            if(p[i]>p[i-1]/p10(d[i-1]-d[i]))
                            {
                                k[i]=d[i-1]+k[i-1]-d[i];
                                w+=k[i];
                                l[i]=0;
                            }
                            else
                            {
                                if(xd(p[i-1]%p10(d[i-1]-d[i])+1)==d[i-1]-d[i])
                                {
                                    if(xd(l[i-1]+1)==k[i-1])
                                    {
                                        k[i]=d[i-1]+k[i-1]-d[i]+1;
                                        w+=k[i];
                                        l[i]=0;
                                    }
                                    else
                                    {
                                        k[i]=d[i-1]+k[i-1]-d[i];
                                        w+=k[i];
                                        l[i]=l[i-1]+1;
                                    }
                                }
                                else
                                {
                                    k[i]=d[i-1]+k[i-1]-d[i];
                                    w+=k[i];
                                    l[i]=0;
                                }
                            }
                        }
                        else
                        {
                            if(d[i]==d[i-1])
                            {
                                if(p[i]>p[i-1])
                                {
                                    k[i]=k[i-1];
                                    l[i]=0;
                                    w+=k[i];
                                }
                                else
                                {
                                    if(p[i]<p[i-1])
                                    {
                                        k[i]=k[i-1]+1;
                                        l[i]=0;
                                        w+=k[i];
                                    }
                                    else
                                    {
                                        if(xd(l[i-1]+1)==k[i-1])
                                        {
                                            k[i]=k[i-1]+1;
                                            l[i]=0;
                                            w+=k[i];
                                        }
                                        else
                                        {
                                            k[i]=k[i-1];
                                            l[i]=l[i-1]+1;
                                            w+=k[i];
                                        }
                                    }
                                }
                            }
                            else
                            {
                                if(p[i]/p10(d[i]-d[i-1])>p[i-1])
                                {
                                    k[i]=d[i-1]+k[i-1]-d[i];
                                    w+=k[i];
                                    l[i]=0;
                                }
                                else
                                {
                                    if(p[i]/p10(d[i]-d[i-1])==p[i-1])
                                    {
                                        if(p[i]%p10(d[i]-d[i-1])>l[i-1]/p10(d[i-1]+k[i-1]-d[i-1]))
                                        {
                                            k[i]=d[i-1]+k[i-1]-d[i];
                                            w+=k[i];
                                            l[i]=0;
                                        }
                                        else
                                        {
                                            if(p[i]%p10(d[i]-d[i-1])<l[i-1]/p10(d[i-1]+k[i-1]-d[i-1]))
                                            {
                                                k[i]=d[i-1]+k[i-1]-d[i]+1;
                                                w+=k[i];
                                                l[i]=0;
                                            }
                                            else
                                            {
                                                if(xd(l[i-1]%p10(d[i-1]+k[i-1]-d[i])+1)==d[i-1]+k[i-1]-d[i])
                                                {
                                                    k[i]=d[i-1]+k[i-1]-d[i]+1;
                                                    w+=k[i];
                                                    l[i]=0;
                                                }
                                                else
                                                {
                                                    k[i]=d[i-1]+k[i-1]-d[i];
                                                    w+=k[i];
                                                    l[i]=l[i-1]%p10(d[i-1]+k[i-1]-d[i])+1;
                                                }
                                            }
                                        }
                                    }
                                    else
                                    {
                                        k[i]=d[i-1]+k[i-1]-d[i]+1;
                                        w+=k[i];
                                        l[i]=0;
                                    }
                                }
                            }
                        }
                    }
                }
                else
                {
                    if(d[i]==d[i-1]+k[i-1])
                    {
                        if(k[i-1]==0)
                        {
                            if(p[i]<=p[i-1])
                            {
                                k[i]=1;
                                ++w;
                                l[i]=0;
                            }
                        }
                        else
                        {
                            if(p[i]<=p[i-1]*p10(k[i-1])+l[i-1])
                            {
                                if(xd(l[i-1]+1)==k[i-1])
                                {
                                    k[i]=k[i-1]+1;
                                    w+=k[i];
                                    l[i]=0;
                                }
                                else
                                {
                                    k[i]=k[i-1];
                                    w+=k[i];
                                    l[i]=l[i-1]+1;
                                }
                            }
                        }
                    }
                }
            }
        }
        //printf("%lld %lld %lld %lld %lld\n", p[i], t[i], d[i], l[i], k[i]);
    }
    printf("%lld\n", w);
    return 0;
}