Given a string of length , n .

It contains either '?' or a digit from '0' to '9'.

Find the number of possible good strings.

Good strings are numbers which leave remainder 7 when divided by 11 and 13.

1<=n<=10000

Example input 1 :

??756

Output : 1

Only 1 good string is possible which is 34756

Example input 2 :

??33?

Output : 10

Some of the possible strings are : { 42335 , 46339 } . There are 8 more strings which are good strings , i.e , they leave remainder 7 when divided by 11 and 13 individually.