The Great Emperor plays chess on an infinite board. The squares of this board are indexed by integer coordinates (x, y). The board is colored in a checkerboard pattern such that the square at (0, 0) is Black and any two squares sharing an edge have different colors.
The Emperor has placed N legendary pieces on the board at specific coordinates. Your task is to count how many of these pieces are standing on Black squares and how many are on White squares.
Input
The first line contains a single integer N (1 \le N \le 10^5) — the number of pieces on the board.
The next N lines each contain two integers x_i and y_i (-10^9 \le x_i, y_i \le 10^9) — the coordinates of the i-th piece.
Output
Print two space-separated integers: the number of pieces on Black squares and the number of pieces on White squares.
Examples
| standard input | standard output |
|---|
| 3
0 0
1 0
1 1
| 2 1
|
| 2
-1 -1
2 3
| 1 1
|