import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    auto S = sread();
    long N = S.length;
    auto dp = new long[][](13, N + 1);
    dp[0][0] = 1;
    foreach (i; 0 .. N)
    {
        if (S[i] == '?')
        {
            foreach (j; 0 .. 10)
                foreach (k; 0 .. 13)
                {
                    dp[(k * 10 + j) % 13][i + 1] += dp[k][i];
                    dp[(k * 10 + j) % 13][i + 1] %= MOD;
                }
            continue;
        }
        foreach (j; 0 .. 13)
        {
            dp[(j * 10 + (S[i] - '0')) % 13][i + 1] += dp[j][i];
            dp[(j * 10 + (S[i] - '0')) % 13][i + 1] %= MOD;
        }
    }
    writeln(dp[5][N]);
}
