/*
author: Apoorv Singh
*/

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

typedef vector <long long> vi;
typedef pair <long long, long long> pii;
#define pb push_back   
#define all(c) c.begin(), c.end()
#define FOR(i, a, b) for (long long i = a; i < b; ++i)
#define FORR(i, a, b) for (long long i = a; i > b; --i)
#define um unordered_map
#define F first
#define S second
#define int long long
#define inf LLONG_MAX
#define endl "\n"
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS

#define TRACE
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif

template <class X>
void printarr(X arr[], int n)
{
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
    cout << endl;
}
template <typename X> ostream& operator << (ostream& x,const vector<X>& v){ for (X a : v) x << a << ' '; return x;} 
template <typename X, typename Y> ostream& operator << (ostream& x, const vector< pair<X, Y> >& v) {for (pair <X, Y> it : v) x << it.first << ' ' << it.second << endl; return x;} 
template <typename T, typename S> ostream& operator << (ostream& os, const map<T, S>& v) { for (pair <T, S> it : v) os << it.first << " => " << it.second << endl; return os; }

double pi = 3.14159265358979323846264338327950288419716939937510582097494459230;
int modulo = 1e9 + 7;

int fpow(int a, int n)
{
    int ans = 1;
    while (n)
    {
        if (n&1)
            ans = (ans * a)%modulo;
        a = (a*a)%modulo;
        n = n >> 1;
    }
    return ans;
}

/*
const int M = 1e6 + 10;
int composite[M] = {0};

void sieve()
{
    FOR(i,2,M)
    {
        if (!composite[i])
        {
            for (int j = 2*i; j < M; j += i)
                composite[j] = max(composite[j], i);
        }
    }
}
*/

string s; 
int n;

const int M = 1e5 + 10;
int dp[M][13], powers[M];

int solve(int i, int j)
{
    if (dp[i][j] != -1)
        return dp[i][j];

    if (i == n-1)
    {
        if (s[i] != '?')
        {
            if ((s[i]-'0') == j)
                return 1;
            return 0;
        }

        if (j <= 9)
            return 1;
        return 0;
    }

    if (s[i] != '?')
    {
        int val = ((s[i]-'0')*powers[i])%13;
        int d = (j-val+13)%13;
        dp[i][j] = solve(i+1, d);
    }

    else
    {
        int ans = 0;
        FOR(k,0,10)
        {
            int val = (k*powers[i])%13;
            int d = (j-val+13)%13;
            ans = (ans + solve(i+1, d))%modulo;
        }
        dp[i][j] = ans;
    }

    return dp[i][j];

}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> s; n = s.length();
    FOR(i,0,n)
    {
        FOR(j,0,13)
            dp[i][j] = -1;
        if (i == 0)
            powers[n-i-1] = 1;
        else
            powers[n-i-1] = (10*powers[n-i])%13;
    }

    cout << solve(0, 5);
    return 0;
}

Measured memory_bytes: 22864