#include<bits/stdc++.h>
using namespace std;

int dp[20][13][2][10];
int b[20];

int dfs(int pos,int preok,int rem,int th,int pre)
{
    if (pos==-1)
    {
        if (rem==0&&th==1) return 1;
        else return 0;
    }
    if (preok&&dp[pos][rem][th][pre]!=-1) return dp[pos][rem][th][pre];
    int up=preok?9:b[pos];
    int ans=0;
    for (int i=0;i<=up;i++)
    {
        ans+=dfs(pos-1,i<b[pos]||preok,(rem*10+i)%13,pre==1&&i==3||th,i);
    }
    if (preok) dp[pos][rem][th][pre]=ans;
    return ans;
}

int solve(int n)
{
    int cnt=0;
    do {
        b[cnt++]=n%10;
        n/=10;
    }while (n);
    return dfs(cnt-1,0,0,0,0);
}

int main()
{
    memset(dp,-1,sizeof(dp));
    int n;
    while (~scanf("%d",&n))
    {
        printf("%d\n",solve(n));
    }
    return 0;
}