#include<cstdio>

 #include<string>

 #include<cstring>

 #include<iostream>

 #define LL long long

 #define LEN 20

 #define is_1 2

 #define have_13 2

 #define mod_by_13 13

 #define pre_same 2

 using namespace std;

 LL t[LEN];

 LL dp[LEN][is_1][have_13][mod_by_13][pre_same];

 string s;

 LL len;

 void init_t();

 void solve();

 int main(void){

     init_t();

     while(cin>>s){

         len=s.size();

         memset(dp,,sizeof(dp));

         dp[][][][][]=;

         solve();

         LL temp=;

         for(int i=;i<is_1;++i)

         for(int j=;j<pre_same;++j)

             temp+=dp[len][i][][][j];

         cout<<temp<<endl;

     }

 }

 void init_t(){

     t[]=;

     for(int i=;i<LEN;++i)

         t[i]=(t[i-]*)%;

 }

 void solve(){

     for(int a=;a<len;++a)

     for(int b=;b<is_1;++b)

     for(int c=;c<have_13;++c)

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

     for(int e=;e<pre_same;++e)

     if(dp[a][b][c][d][e]){

         int r=(e?s[a]-'':);

         for(int x=;x<=r;++x){

             dp[a+][x==][c|(b&&x==)][(d+t[len-a-]*x)%][e&&x==r]

                 +=dp[a][b][c][d][e];

         }

     }

 }