% Author: Sergey Kopeliovich
% Source: SPBU Championship, October 2013

\gdef\thisproblemauthor{Sergey Kopeliovich}
\gdef\thisproblemdeveloper{Sergey Kopeliovich}

\begin{problem}{Four Prime Numbers}
{fourprimes.in}{fourprimes.out}
{1 second (\textsl{2 seconds for Java})}{256 mebibytes}{}

You are given an integer $n$.

How many ways there are to represent it as a sum of four prime numbers?

\InputFile

The only line of input contains a single integer $n$ ($1 \le n \le 10^5$).

\OutputFile

Print one number: the number of ways to represent $n$
as a sum of four prime numbers. 

\Example

\begin{example}
\exmp{
9
}{
4
}%
\end{example}

\Note

Number \mbox{$9 = 2 + 2 + 2 + 3 =
                  2 + 2 + 3 + 2 =
                  2 + 3 + 2 + 2 =
                  3 + 2 + 2 + 2$}.

\end{problem}
