Submit solution

Points:
12 (partial)

Time limit:
1.0s

Python
4.0s

Memory limit:
512M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

* has been captured!*

After his army was defeated and his bunker discovered, he was found protecting a mysterious, password-protected box. **hewmatt100**.

She now hypothesizes:

, where is a subsequence of (represented in base 10), but

likes any integerdoes notlike if appears as a subsequence as well.Some numbers which he likes are

10,180, 817909, and 4041404.Some numbers he

does notlike are100,10000, 2,1800, and 8081709005.

Given an integer , help find out how many integers between and (inclusive) likes, modulo .

#### Input Specification

The only line of input will contain .

##### Subtask 1 [10%]

##### Subtask 2 [90%]

#### Output Specification

Output how many integers and (inclusive), modulo .

likes between#### Sample Input 1

`200`

#### Sample Output 1

`19`

#### Explanation

The 19 numbers are 10, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 120, 130, 140, 150, 160, 170, 180, and 190.

#### Sample Input 2

`10000`

#### Sample Output 2

`486`

## Comments