#include<cstdio>

 #include<cstring>

 #define F(i,a,b) for(int i=a;i<=b;i++)

 int dp[][][][],n,dig[],len;

 int dfs(int pos,int pre,int mod,bool have,bool inf){

     if(!pos)return (have&&!mod);

     if(!inf&&dp[pos][pre][mod][have]!=-)return dp[pos][pre][mod][have];

     int end=inf?dig[pos]:,ans=;

     F(i,,end)if(pre==&&i==)ans+=dfs(pos-,i,(mod*+i)%,,inf&&(i==dig[pos]));

         else ans+=dfs(pos-,i,(mod*+i)%,have,inf&&(i==dig[pos]));

     if(!inf)dp[pos][pre][mod][have]=ans;

     return ans;

 }

 int main(){

     memset(dp,-,sizeof(dp));

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

         for(len=;n;)dig[++len]=n%,n/=;

         printf("%d\n",dfs(len,,,,));

     }

     return ;

 }