#include <bits/stdc++.h>

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <map>

 #include <algorithm>

 #include <vector>

 #include <iostream>

 #define pii pair<int,int>

 #define INF 0x7f3f3f3f

 #define LL long long

 #define ULL unsigned long long

 using namespace std;

 const double PI  = acos(-1.0);

 const int N=;

 int f[N][N][][], bit[N];

 //[位数][前缀][模13的余数][是否包含13]

 int dfs(int i,int pre,int mod,bool B,bool e)

 {

     if(i==)    return !mod&&B;

     if(!e && ~f[i][pre][mod][B])    return f[i][pre][mod][B];

     int ans=, m=;

     int u= e? bit[i]: ;

     for(int d=; d<=u; d++)

     {

         m=(mod*+d)%;

         if( pre==&&d== )

             ans+=dfs(i-, d, m, true, e&&d==u);

         else

             ans+=dfs(i-, d, m, B, e&&d==u);

     }

     return e? ans: f[i][pre][mod][B]=ans;

 }

 int cal(int n)

 {

     int len=;

     while(n)    //拆数

     {

         bit[++len]=n%;

         n/=;

     }

     return dfs(len, , , false, true);

 }

 int main()

 {

     //freopen("input.txt","r",stdin);

     memset(f,-,sizeof(f));

     int n;

     while( ~scanf("%d",&n) )

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

     return ;

 }