B"Integers from 1 to n (inclusive) were sorted lexicographically (considering integers as strings). As a result, array a_1, a_2, ... , a_n was obtained. Calculate value of ( sum_{i = 1}^n ((i - a_i) mod 998244353)) mod 10^9 + 7 . x mod y here means the remainder after division x by y . This remainder is always non-negative and doesn't exceed y - 1 . For example, 5 mod 3 = 2 , (-1) mod 6 = 5 . The first line contains the single integer n ( 1 <= q n <= q 10^{12} ). Print one integer -- the required sum. A string a is lexicographically smaller than a string b if and only if one of the following holds: For example, 42 is lexicographically smaller than 6 , because they differ in the first digit, and 4 < 6 ; 42 < 420 , because 42 is a prefix of 420 . Let's denote 998244353 as M . In the first example, array a is equal to [1, 2, 3] . As a result, (0 + 0 + 0) mod 10^9 + 7 = 0 In the second example, array a is equal to [1, 10, 11, 12, 2, 3, 4, 5, 6, 7, 8, 9] . As a result, (0 + 998244345 + 998244345 + 998244345 + 3 + 3 + 3 + 3 + 3 + 3 + 3 + 3) mod 10^9 + 7 = 2994733059 mod 10^9 + 7 = 994733045 "...