output_description: Print the number of integers satisfying the condition, modulo 10^9+7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: # from collections import *
  # from itertools import *
  # from bisect import *
  # from heapq import *
  # import copy
  # import math
  # N=int(input())
  # X,Y=map(int,input().split())
  # S=list(map(int,input().split()))
  # S=[list(map(int,input().split())) for i in range(N)]
  S = input()
  mod = 10**9 + 7
  Scount = S.count("?")
  X = pow(10, Scount)
  count = (X - 5) // 13
  amari = (X - 5) % 13
  print((count - 1) % mod)
  
problem_description: Statement
  
  Given is a string S. Each character in S is either a digit (`0`, ..., `9`) or
  `?`.
  
  Among the integers obtained by replacing each occurrence of `?` with a digit,
  how many have a remainder of 5 when divided by 13? An integer may begin with
  0.
  
  Since the answer can be enormous, print the count modulo 10^9+7.
samples: [{"input": "??2??5", "output": "768\n    \n\nFor example, 482305, 002865, and 972665 satisfy the condition.\n\n* * *"}, {"input": "?44", "output": "1\n    \n\nOnly 044 satisfies the condition.\n\n* * *"}, {"input": "7?4", "output": "0\n    \n\nWe may not be able to produce an integer satisfying the condition.\n\n* * *"}, {"input": "?6?42???8??2??06243????9??3???7258??5??7???????774????4?1??17???9?5?70???76???", "output": "153716888"}]