Triangular web

In front of you there is an endless triangular grid. It is arranged in such a way that if you fire a vertex, then this vertex lights up, next second all the vertices next to the given one light up, then all the vertices next to those already burning light up, etc. Consider that the fire will never go out.

Initially, only one vertex fires. Find the number of burning vertices after $n$ seconds.

Input

One number $n(0\le n\le 10^9)$.

Output

Print the number of burning vertices after $n$ seconds.

Examples