1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int maxn = 15;
 4 int dp[maxn][maxn][3],b[maxn],n;
 5 int dfs(int p,int st,int mod,bool flag) {
 6     if(!p) return st == 2 && mod == 0;
 7     if(flag && dp[p][mod][st] != -1) return dp[p][mod][st];
 8     int ret = 0,u = flag?9:b[p];
 9     for(int i = 0; i <= u; ++i) {
10         int tmp = (mod*10 + i)%13;
11         if(st == 2 || st == 1 && i == 3) ret += dfs(p-1,2,tmp,flag||(i < u));
12         else if(i == 1) ret += dfs(p-1,1,tmp,flag||(i < u));
13         else ret += dfs(p-1,0,tmp,flag||(i < u));
14     }
15     if(flag) dp[p][mod][st] = ret;
16     return ret;
17 }
18 int solve(int x) {
19     int len = 0;
20     while(x) {
21         b[++len] = x%10;
22         x /= 10;
23     }
24     return dfs(len,0,0,0);
25 }
26 int main() {
27     memset(dp,-1,sizeof dp);
28     while(~scanf("%d",&n)) printf("%d\n",solve(n));
29     return 0;
30 }