#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string S;
  cin >> S;
  ll N = S.size();
  vvl DP = VVL(N + 1, 14, 0);

  if (N % 3 == 1) {
    S = "00" + S;
    N += 2;
  } else if (N % 3 == 2) {
    S = "0" + S;
    N += 1;
  }
  ll on = 1;
  if (N % 6 == 0)
    on = -1;

  DP[0][0] = 1;

  REP(i, N / 3) {
    vl count(3, 0);
    ll score = 0;
    REP(j, 3) {
      if ((i * 3) + j >= N)
        continue;
      if (S[(i * 3) + j] == '?')
        count[j]++;
      else
        score += on * (S[(i * 3) + j] - '0') * POW(10, 2 - j);
    }
    vvl PO = VVL(4, 13, 0);
    PO[0][(score + 13000) % 13] = 1;

    REP(p, 3) {
      if (count[p] == 1) {
        REP(l, 10) {
          REP(m, 13) {
            PO[p + 1][(m + (l * POW(10, 2 - p) * on) + 13000) % 13] += PO[p][m];
            PO[p + 1][(m + (l * POW(10, 2 - p) * on) + 13000) % 13] %= MOD;
          }
        }
      } else {
        PO[p + 1] = PO[p];
      }
    }

    REP(p, 13) {
      REP(j, 13) {
        ll k = (j + p + 1300) % 13;
        DP[i + 1][k] += (DP[i][j] * PO[3][p]) % MOD;
        DP[i + 1][k] %= MOD;
      }
    }
    on *= -1;
  }
  cout << DP[N / 3][5] << endl;
  return 0;
}


Measured memory_bytes: 15312