//
//  main.cpp
//

#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

using ll = int64_t;
using ull = uint64_t;

template<typename T>
vector<T> make_vec_nd(T init, ll size) {
    return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, ll size, Args... rest) {
    auto inner = make_vec_nd(init, rest...);
    return vector<decltype(inner)>(size, inner);
}

#define rep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrep(i,a,b) for(ll i=(a)-1;i>=(b);i--)

struct Mod {
    static ll gcd(ll x, ll y, ll* out_cx, ll* out_cy) {
        if (x < 0) {
            ll d = gcd(-x, y, out_cx, out_cy);
            if (out_cx) {
                *out_cx *= -1;
            }
            return d;
        }
        if (y < 0) {
            ll d = gcd(x, -y, out_cx, out_cy);
            if (out_cy) {
                *out_cy *= -1;
            }
            return d;
        }
        if (x > y) {
            return gcd(y, x, out_cy, out_cx);
        }
        if (x == 0) {
            if (out_cx && out_cy) {
                *out_cx = 0;
                *out_cy = 1;
            }
            return y;
        }
        ll q = y / x;
        ll r = y % x;
        ll d = gcd(r, x, out_cy, out_cx);
        if (out_cx) {
            *out_cx -= q * *out_cy;
        }
        return d;
    }
    static ll BASE;
    ll value = 0;
    static ll residue(ll value) { return (value % BASE + BASE) % BASE; }
    Mod()
    : value(0) {}
    Mod(ll value)
    : value(residue(value)) {}
    Mod operator+(const Mod& rhs) const { return Mod(value + rhs.value); }
    void operator+=(const Mod& rhs) { *this = *this + rhs; }
    Mod operator-(const Mod& rhs) const { return Mod(value - rhs.value); }
    void operator-=(const Mod& rhs) { *this = *this - rhs; }
    Mod operator*(const Mod& rhs) const { return Mod(value * rhs.value); }
    void operator*=(const Mod& rhs) { *this = *this * rhs; }
    Mod operator/(const Mod& rhs) const { return *this * rhs.inv(); }
    void operator/=(const Mod& rhs) { *this = *this / rhs; }
    Mod inv() const {
        if (value == 0) {
            assert(false);
            throw "[Mod::inv] div by zero";
        }
        ll ans, sub;
        ll d = Mod::gcd(value, BASE, &ans, &sub);
        if (d != 1) {
            assert(false);
            throw "[Mod::inv] not invertible";
        }
        return ans;
    }
};
ll Mod::BASE = 1000000007;

int main() {
    string S;
    cin >> S;
    auto dp = make_vec_nd((Mod)0, S.size()+1, 13);
    dp[0][0] = 1;
    ll pow_ten = 1;
    rep(i,0,S.size()) {
        if (S[S.size()-1-i] == '?') {
            rep(digit,0,10) {
                ll diff = (pow_ten * digit) % 13;
                rep(m,0,13) {
                    dp[i+1][m] += dp[i][((m-diff)%13+13)%13];
                }
            }
        } else {
            ll digit = S[S.size()-1-i] - '0';
            ll diff = (pow_ten * digit) % 13;
            rep(m,0,13) {
                dp[i+1][m] += dp[i][((m-diff)%13+13)%13];
            }
        }
        pow_ten *= 10;
        pow_ten = pow_ten % 13;
    }
    cout << dp[S.size()][5].value << endl;
}


Measured memory_bytes: 13632