#define REP(i, a, b) for(int i = a; i <= b; i ++)
#define REPG(i, x) for(int i = head[x]; i; i = g[i].nxt)
#define clr(x, y) memset(x, y, sizeof(x));
using namespace std;
typedef long long LL;
typedef double LF;
LL (LL a, LL b){return a > b ? a : b;}
LL Min(LL a, LL b){return a < b ? a : b;}
LL abs(LL x){return x > 0 ? x : -x;}
const int MAXN = 25;
int n, num[MAXN], f[MAXN][MAXN][MAXN];
inline int read(){
	int r = 0, z = 1; char ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-') z = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9'){r = r * 10 + ch - '0'; ch = getchar();}
	return r * z;
}
int dfs(int len, int mod, int typ, bool sx){
	if(len == 0) return mod == 0 && typ == 2;
	if(!sx && f[len][mod][typ] != -1) return f[len][mod][typ];
	int maxx = sx ? num[len] : 9, mod_, typ_, sx_, cnt = 0;
	for(int i = 0; i <= maxx; i ++){
		mod_ = ((mod * 10) + i) % 13;
		typ_ = typ;
		if(typ == 0 && i == 1) typ_ = 1;
		if(typ == 1 && i != 1) typ_ = 0;
		if(typ == 1 && i == 3) typ_ = 2;
		sx_ = (sx && i == maxx);
		cnt += dfs(len - 1, mod_, typ_, sx_);
	}
	if(!sx) f[len][mod][typ] = cnt;
	return cnt;
}
int solve(int x){
	int k = 0;
	while(x){num[++ k] = x % 10; x /= 10;}
	return dfs(k, 0, 0, 1);
}
void work(){
	while(~scanf("%d", &n)){
		clr(f, -1);
		printf("%dn", solve(n));
	}
}
int main(){
	work();
	return 0;
}