#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <map>

#define INF (1<<30)
#define mod 666013


using namespace std;
typedef long long ll;
ll n, x, c, p, t, a[15];
map <ll, ll> mp;
int main()
{
    //freopen("1.in", "r", stdin);
    //freopen("1.out", "w", stdout);
    scanf("%lld", &n);
    a[0]=1;
    for(c=1;c<=10;c++)
        a[c]=a[c-1]*10;
    for(c=0;c<=9;c++)
        for(p=1;p<=8;p++)
        {
            x=(n%a[p-1])+c*a[p-1]+a[p]*(n/a[p]);
            if(mp[x]) continue;
            mp[x]=1;
            t++;
        }
    printf("%lld", t);
    return 0;
}