#include <stdio.h>
#include <algorithm>

using namespace std;

int multime[100],nr;

int main()
{
    char n[15];
    scanf("%s",&n);

    for (int pos=1;pos<=8;++pos)
    {
        int num = 0;
        for (int i=2;i<=pos;++i)
        {
            num = num*10+(n[i]-'0');
        }

        int num2=num;
        for (int i=0;i<=9;++i)
        {
            num=num2;
            num = num*10+i;


            for (int j=pos+1;j<=8;++j)
            {
                num=num*10+(n[j]-'0');
            }

            ++nr; multime[nr]=num;

        }


    }

    sort(multime+1,multime+1+nr);
    int sol=0;
    for (int i=1;i<=nr;++i)
    {
        if (multime[i]!=multime[i-1]) ++sol;
    }

    printf("%d\n",sol);



    return 0;
}