#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(),(X).end()

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

const ll mod = 1e9+7;
using modint = ModInt< mod >;


string S;
int N;

void input(){
  fast_io();
  #ifdef __LOCAL
    fs::path p = __FILE__;
    fs::path input,output;
    input = output = p.parent_path();
    input += string("/input/") + string(p.stem()) + string(".txt");
    output += string("/output/") + string(p.stem()) + string(".txt");
    freopen(input.c_str(), "r", stdin);
    freopen(output.c_str(), "w", stdout);
  #endif
  cin >> S;
  N=S.size();
}

modint count_dig(ll dig){
  if(dig==0) return modint(1);
  if(dig==1) return modint(1);
  if(dig==2) return modint(7);
  else return modint(10).pow(dig-2)*modint(7)*dig*(dig-1)/2;
}

// 1001が13の倍数であることに着目した解答。
// ABCDEF = DEF-ABC (mod 13) を利用して、最終的に3桁の計算に落とし込んでる。
int solve(){
  vector<string> T;
  reverse(S.begin(),S.end());
  int i=0;
  while(S.size()>0){
    string s=S.substr(0,3);
    reverse(s.begin(),s.end());
    while(s.size()<3) s = "0"+s;
    if(i%2==0) T.push_back(s);
    if(i%2==1) {T.push_back("-"+s);T.push_back("002");}
    S = (S.size()>=3)?S.substr(3):"";
    i++;
  }
  DBG(T)
  
  ll dig0=0;
  ll dig1=0;
  ll dig2=0;
  ll digM=0;

  for(auto t:T){
    while(t.size()<=2) t="0"+t;
    if(t[0]=='-'){
      if(t[1]=='?') dig2++;
      else digM += ('9'-t[1])*100;
      if(t[2]=='?') dig1++;
      else digM += ('9'-t[2])*10;
      if(t[3]=='?') dig0++;
      else digM += ('9'-t[3])*1;
    }
    else{
      if(t[0]=='?') dig2++;
      else digM += (t[0]-'0')*100;
      if(t[1]=='?') dig1++;
      else digM += (t[1]-'0')*10;
      if(t[2]=='?') dig0++;
      else digM += (t[2]-'0')*1;
    }
  }
  digM%=13;

  // DBG(dig0)
  // DBG(dig1)
  // DBG(dig2)
  // DBG(digM)
  struct DIG{
    int d0,d1,d2;
    DIG(int i, int j, int k):d2(i),d1(j),d0(k){};
  };
  vector<DIG> ans;
  REP(i,13) REP(j,13) REP(k,13) {
    if(dig0==0&&k!=0) continue; 
    if(dig1==0&&j!=0) continue; 
    if(dig2==0&&i!=0) continue; 
    if((100*i+10*j+k+digM)%13==5) ans.emplace_back(i,j,k);
    }
  // for(auto a:ans) cout << a.d2 << " " << a.d1 << " " << a.d0 << "\n";
  modint res=0;
  int Maxdig = max({dig0,dig1,dig2});
  // dp[i][a]:d(=0~2)桁目の?がi個あるとき、それらの合計がa(=0~12)になる組み合わせの総数。
  modint dp[Maxdig+10][13];
  memset(dp,0,sizeof(dp));
  dp[0][0] = 1;
  REP(i,13) dp[1][i] = (i<=9)?1:0;
  REP(i,Maxdig+1) REP(a,13) REP(k,13) dp[i+2][a] += (((a-k+13)%13)<=9) ? dp[i+1][k] : modint(0);
  for(auto a:ans) res += dp[dig2][a.d2]*dp[dig1][a.d1]*dp[dig0][a.d0];
  cout << res << endl;

  return 0;
}

// dp[i][j] := 先頭i文字として考えられるもののうち、13で割ったあまりがjであるものの数。
// dp[N][5]が求める答え。
modint dp[100010][13];
int dp_solve(){
  memset(dp,0,sizeof(dp));
  dp[0][0] = 0;
  if(S[0]=='?') REP(a,10) dp[1][a] = 1;
  else dp[1][(S[0]-'0')] = 1;
  for(int i=1;i<N;i++) REP(j,13) {
    if(S[i]=='?'){
      REP(a,10) dp[i+1][(10*j+a)%13] += dp[i][j];
    }
    else{
      dp[i+1][(10*j+(S[i]-'0'))%13] += dp[i][j];
    }
  }
  cout << dp[N][5] << endl;
  return 0;
}

int main()
{
  input();
  dp_solve();
  return 0;
}


Measured memory_bytes: 5632