/*
 * FILE: D - Digits Parade.cpp
 *
 * @author: Piyush Kanti Das <piyush123kantidas[at]gmail[dot]com>
 *
 * LINK:
 *
 * DATE CREATED: 07.08.2019 12:22:03 +06
 *
 * DESCRIPTION:
 *
 * DEVELOPMENT HISTORY:
 * Date         Version     Description
 * --------------------------------------------------------------
 * 07-08-2019	1.0         File Created
 *
 */


/*
// _______________________________________________________________/\\\_________
//  ______________________________________________________________\/\\\_________
//   ___/\\\\\\\\\___/\\\____/\\\__/\\\____________________________\/\\\_________
//    __/\\\/////\\\_\///____\//\\\/\\\___/\\\____/\\\__/\\\\\\\\\\_\/\\\_________
//     _\/\\\\\\\\\\___/\\\____\//\\\\\___\/\\\___\/\\\_\/\\\//////__\/\\\\\\\\\\__
//      _\/\\\//////___\/\\\_____\//\\\____\/\\\___\/\\\_\/\\\\\\\\\\_\/\\\/////\\\_
//       _\/\\\_________\/\\\__/\\_/\\\_____\/\\\___\/\\\_\////////\\\_\/\\\___\/\\\_
//        _\/\\\_________\/\\\_\//\\\\/______\//\\\\\\\\\___/\\\\\\\\\\_\/\\\___\/\\\_
//         _\///__________\///___\////_________\/////////___\//////////__\///____\///__
//
*/

#include<bits/stdc++.h>
using namespace std;

typedef long long           ll;
typedef double              lf;
typedef unsigned long long  ull;
typedef pair<int, int>      pii;
typedef vector<pii>         vpii;
typedef vector<int>         vi;
typedef vector<long long>   vll;

#define __FastIO        ios_base::sync_with_stdio(false); cin.tie(0)

#define forr(i, a, b)   for (__typeof (a) i=a; i<=b; i++)
#define rof(i, b, a)    for (__typeof (a) i=b; i>=a; i--)
#define rep(i, n)       for (__typeof (n) i=0; i<n; i++)
#define forit(i, s)     for (__typeof ((s).end ()) i = (s).begin (); i != (s).end (); ++i)
#define all(ar)         ar.begin(), ar.end()

#define fill(ar)   		memset(ar, -1, sizeof(ar))
#define clr(a)          memset(a, 0, sizeof(a))

#define nl              cout << '\n';
#define sp              cout << ' ';
#define ckk             cout << "##########\n"

#define pb              push_back
#define MP 				make_pair

#define debug1(x)       cerr << #x << ": " << x << endl
#define debug2(x, y)    cerr << #x << ": " << x << '\t' << #y << ": " << y << endl
#define debug3(x, y, z) cerr << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": " << z << endl

#define gama 0.57721566490
#define PI              acos(-1.0)
#define INF             0x7fffffff
#define MOD             1000000007
#define EPS             1e-7
#define MAX             100005

int Set(int N,int pos){return N=N | (1<<pos);}
int Reset(int N,int pos){return N= N & ~(1<<pos);}
bool Check(int N,int pos){return (bool)(N & (1<<pos));}


ll BM( ll a , ll b , ll m )
{
    if ( b == 0 ) return 1 ;
    ll x = BM(a,b/2,m);
    x = (x*x)%m;
    
    if( b % 2 ) x = ( x * a);
    return x%m ;
}

//Auto-format --> ctrl+shift+a
/********************* Code starts here ************************/

string s;
int n;
ll dp[MAX][15], mul[MAX];

ll fun(ll pos, ll sum)
{
	if(pos == n){
		if(sum == 5){
			return 1LL;
		}else{
			return 0LL;
		}
	}
	
	ll &ans = dp[pos][sum];
	
	if(ans != -1){
		return ans;
	}
	
	ans = 0LL;
	
	if(s[pos] == '?'){
		ll n_sum;
		for(ll i = 0; i < 10; i++){
			n_sum = sum;
			n_sum += (i*mul[n - pos - 1]);
			n_sum %= 13LL;
			
			ans += fun(pos + 1, n_sum);
		//	ans %= MOD;
		}
	}
	else{
		ll dig = (ll)(s[pos] - '0');
		dig *= mul[n - pos - 1];
		dig += sum;
		dig %= 13LL;
		ans += fun(pos + 1, dig);
		//ans %= MOD;
	}
	ans %= MOD;
	
	return ans;
}

int main() {
    __FastIO;   //Be aware to use it!
    
	
	cin >> s;
	n = (int)s.size();
	fill(dp);
	
	
	for(ll i = 0; i <= 100000; i++){
		 mul[i] = BM(10LL, i, 13LL);
	}
	
	ll ans = fun(0LL, 0LL);
	
	cout << ans << endl;
    
    return 0;
}


Measured memory_bytes: 19280