using System;
using System.Collections.Generic;
using System.Linq;
using BitArray = System.Collections.BitArray;
using BigInteger = System.Numerics.BigInteger;

namespace AtCoderProject
{
    public class Program
    {
        public object Calc()
        {
            var s = consoleReader.String;
            var counts = new Mod[13];
            if (s[0] == '?')
            {
                for (int i = 0; i < 10; i++)
                    counts[i] = 1;
            }
            else
            {
                var item = s[0] - '0';
                counts[item] = 1;
            }

            foreach (var c in s.Skip(1))
            {
                var olds = counts;
                counts = new Mod[13];
                if (c == '?')
                {
                    for (int item = 0; item < 10; item++)
                        for (int i = 0; i < 13; i++)
                        {
                            var next = (item + 10 * i) % 13;
                            counts[next] += olds[i];
                        }
                }
                else
                {
                    var item = c - '0';
                    for (int i = 0; i < 13; i++)
                    {
                        var next = (item + 10 * i) % 13;
                        counts[next] += olds[i];
                    }
                }
            }

            return counts[5];
        }
        #region いつもの
        private readonly ConsoleReader consoleReader;
        public Program(ConsoleReader consoleReader) { this.consoleReader = consoleReader; }
        static void Main() => Console.WriteLine(new Program(new ConsoleReader()).Calc()); static string AllLines<T>(IEnumerable<T> source) => string.Join("\n", source);
        #endregion
    }
    struct Mod : IEquatable<Mod>
    {
        public const long mod = 1000000007;
        public readonly long val;
        public Mod(long val) { this.val = val; }
        public override bool Equals(object obj) => (obj is Mod) ? this == ((Mod)obj) : false;
        public bool Equals(Mod obj) => this == obj;
        public override int GetHashCode() => val.GetHashCode();
        public override string ToString() => val.ToString();
        public static implicit operator Mod(long x) => new Mod(x);
        public static Mod operator +(Mod x, Mod y) => (x.val + y.val) % mod;
        public static Mod operator -(Mod x, Mod y) => x.val >= y.val ? (x.val - y.val) % mod : (x.val - y.val) % mod + mod;
        public static Mod operator *(Mod x, Mod y) => (x.val * y.val) % mod;
        public static Mod operator /(Mod x, Mod y) => x * y.Inverse();
        public static bool operator ==(Mod x, Mod y) => x.val == y.val;
        public static bool operator !=(Mod x, Mod y) => x.val != y.val;
        public Mod Inverse()
        {
            long a = val, b = mod, u = 1, v = 0;
            while (b > 0)
            {
                long t = a / b;
                var b2 = a - t * b;
                a = b; b = b2;
                var v2 = u - t * v;
                u = v; v = v2;
            }
            u %= mod;
            if (u < 0) u += mod;
            return u;
        }
        public static Mod Pow(Mod x, int y)
        {
            Mod res = 1;
            for (; y > 0; y >>= 1)
            {
                if ((y & 1) == 1) res *= x;
                x *= x;
            }
            return res;
        }

        public static Factor CreateFactor(int max) => new Factor(max);
        public class Factor
        {
            private readonly Mod[] fac, finv;
            public Factor(int max)
            {
                var inv = new Mod[max];
                fac = new Mod[max]; finv = new Mod[max];
                fac[0] = fac[1] = 1;
                finv[0] = finv[1] = 1;
                inv[1] = 1;
                for (int i = 2; i < max; i++)
                {
                    fac[i] = fac[i - 1] * i;
                    inv[i] = mod - inv[mod % i].val * (mod / i) % mod;
                    finv[i] = finv[i - 1] * inv[i];
                }
            }

            // 二項係数計算
            public Mod Combine(int n, int k)
            {
                if (n < k) return 0;
                if (n < 0 || k < 0) return 0;
                return fac[n] * finv[k] * finv[n - k];
            }

            public Mod Factorial(int n) => fac[n];
            public Mod FactorialInvers(int n) => finv[n];
        }
    }

#pragma warning disable
    public class ConsoleReader { public class SplitLine { string[] splited; public SplitLine(string line) { splited = line.Split(); } public string[] String => splited.ToArray(); public int[] Int => splited.Select(int.Parse).ToArray(); public long[] Long => splited.Select(long.Parse).ToArray(); public ulong[] ULong => splited.Select(ulong.Parse).ToArray(); public double[] Double => splited.Select(double.Parse).ToArray(); } public class RepeatLine { ConsoleReader reader; int num; public RepeatLine(ConsoleReader reader, int num) { this.reader = reader; this.num = num; } public IEnumerable<string> String { get { for (int i = 0; i < num; i++) yield return reader.String; } } public IEnumerable<int> Int { get { for (int i = 0; i < num; i++) yield return reader.Int; } } public IEnumerable<long> Long { get { for (int i = 0; i < num; i++) yield return reader.Long; } } public IEnumerable<string[]> SplitString { get { for (int i = 0; i < num; i++) yield return reader.Split.String; } } public IEnumerable<int[]> SplitInt { get { for (int i = 0; i < num; i++) yield return reader.Split.Int; } } } public virtual string String => Console.ReadLine(); public int Int => int.Parse(String); public long Long => long.Parse(String); public ulong ULong => ulong.Parse(String); public double Double => double.Parse(String); public SplitLine Split => new SplitLine(String); public RepeatLine Repeat(int count) => new RepeatLine(this, count); }
}

Measured memory_bytes: 17328