HDU 3652 B-number （动态规划-数位DP）

 

B-number

 

Problem Description

 

A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. Your task is to calculate how many wqb-numbers from 1 to n for a given integer n.

 

 

Input

 

Process till EOF. In each line, there is one positive integer n(1 <= n <= 1000000000).

 

 

Output

 

Print each answer in a single line.

 

 

Sample Input

 

13 100 200 1000

 

 

Sample Output