On the plane are given \textbf{N} distinct points. Required to find many ways to choose three of them, so that the area of ​​a triangle with vertices at these points was an integer. We assume that three points on one line, form a triangle. \InputFile The first line contains the number \textbf{N} (\textbf{1} ≤ \textbf{N} ≤ \textbf{10000}). Followed by \textbf{N} pairs of non-negative integers that define thethe coordinates of the the points . All coordinates does not exceed \textbf{1000}. \OutputFile Bring out one number - the required number of triple points.