f91#1206

f91

1 second

64 megabytes

Very easy

McCarthy is a well-known computer science theorist. In one of his works, he defined a recursive function called f91, which is defined for any positive integer $n$ as follows:

If $n \leq 100$ n \leq 100, then $f91 (n) = f91 (f91 (n + 11))$ \textbf{f91}(n) = \textbf{f91}(\textbf{f91}(n + 11));

If $n \geq 101$ n \geq 101, then $f91 (n) = n - 10$ \textbf{f91}(n) = n - 10.

Input

A positive integer $n$ not greater than $1000000$ .

Output

The value of $f91 (n)$ .

Examples

Example 1

Loading

n \leq 100

f91 (n) = f91 (f91 (n + 11))

n \geq 101

f91 (n) = n - 10