Stars

Input

The first line of the input contains a natural number 1 \leq n \leq 128. The coordinates of the cubes are integers from $0$ to n-1. Then follow records describing events, one per line. At the beginning of each line is an integer $m$. If $m$ is:

• $1$, then it is followed by $4$ numbers: $x$, $y$, $z$ (0 \leq x, y, z < n) and $k$ (-20000 \leq k \leq 20000) — the coordinates of a cube and the amount by which the number of visible stars in it has changed;

• $2$, then it is followed by $6$ numbers: x_1, y_1, z_1, x_2, y_2, z_2 (0 \leq x_1 \leq x_2 < n, 0 \leq y_1 \leq y_2 < n, 0 \leq z_1 \leq z_2 < n), which means that Petya asked to count the number of stars in the cubes (x, y, z) in the region: x_1 \leq x \leq x_2, y_1 \leq y \leq y_2, z_1 \leq z \leq z_2;

• $3$, then this means that Vasya is tired of observing the stars and answering Petya's questions. This entry appears in the input file only once and will be the last one.

The number of records in the input file does not exceed $100002$.

Output

For each of Petya's questions, output one number per line — the required number of stars.

Examples