\begin{problem}{Nine Out Of Ten}{\textsl{standard input}}{\textsl{standard output}}{1 second}{1024 mebibytes}

A mad scientist conducted $n$ independent identical experiments and claimed that $x$ of them were successful. It is well known that the mad scientist is wrong in exactly 90\% of cases when determining the success of a single experiment. Your task is to write a program that calculates the minimum and the maximum possible number of successful experiments for all $x$ from $0$ to $n$. It is guaranteed that the total number of experiments is always divisible by $10$.

\InputFile
The first line contains a single integer $n$, which is a multiple of ten ($10 \le n \le 10\,000$).

\OutputFile
Print $n + 1$ lines. On the $i$-th line, output two integers separated by a space: the minimum and the maximum possible number of successful experiments for $x = i - 1$.

\Example

\begin{example}
\exmpfile{example.01}{example.01.a}%
\end{example}

\end{problem}

