eolymp
bolt
Try our new interface for solving problems

f91

McCarthy is a famous theorician of computer science. In his work, he defined a recursive function, called \textbf{f91}, that takes as input a positive integer \textbf{n} and returns a positive integer defined as follows: If \textbf{n} ≤ \textbf{100}, then \textbf{f91}(\textbf{n}) =\textbf{ f91}(\textbf{f91}(\textbf{n} + \textbf{11})); If \textbf{n} ≥ \textbf{101}, then \textbf{f91}(\textbf{n}) = \textbf{n} - \textbf{10}. \InputFile A positive integer \textbf{n} not greater than \textbf{1000000}. \OutputFile The value of \textbf{f91}(\textbf{n}).
Time limit 1 second
Memory limit 64 MiB
Input example #1
91
Output example #1
91