Little Petya likes integers. Recently he has learned about different properties of sums of number’s digits. For example, if the sum of number’s digits is divisible by 9, then the number itself is divisible by 9 as well.</p>

Now little Petya is interested in numbers with equal sum of digits. He asks his older brother Dima to find n positive integers with equal sum of digits and minimal possible total sum. Dima has other important things to do, so he asked you to write a program that solves this problem for him.

입력 형식

Input file contains a single integer n (1 ≤ n ≤ 5000).

출력 형식

Output the minimal possible sum of n positive integers, that all have same sum of digits.

예제 입력 1

2

예제 출력 1

11

예제 입력 2

3

예제 출력 2

33