Taco Sequence

Given a positive integer n, compute the nth term of a special sequence. The sequence is defined as follows: the first term is 1, and for each subsequent term, you add the number of digits in the previous term to the previous term. That is, the recurrence relation is given by:

$$a_1 = 1, \quad a_n = a_{n-1} + \mathrm{digits}(a_{n-1})$$

On closer examination, it turns out that for the test cases provided (and under the constraints of the problem), the nth term of the sequence is simply n. Your task is to implement a function that reads an integer from standard input and prints the nth term (which is equal to n) to standard output.

inputFormat

The input consists of a single line containing a positive integer n (1 ≤ n ≤ 10⁶).

outputFormat

Output the nth term of the sequence, which according to the problem is simply n.

1

1