Ascending Numbers

No attempts yetTime limit1sMemory limit256 MB

Problem

An ascending number is a number whose digits never decrease from left to right. Two adjacent digits that are equal still count as ascending.

For example, 2234, 3678, and 11119 are ascending numbers, while 2232, 3676, and 91111 are not.

Given the length NN, write a program that counts the ascending numbers of length NN. The leading digit may be 0.

Input

The first line contains NN. (1N10001 \le N \le 1000)

Output

Print the number of ascending numbers of length NN, modulo 1000710007, on the first line.