Stars
Vasya loves stargazing, but he can't observe the entire sky at once. Instead, he focuses on a specific section of space, defined by a cube with dimensions n×n×n. This large cube is further divided into smaller cubes, each measuring 1×1×1. During his observations, the following events can occur:
Stars may appear or disappear in any of these smaller cubes.
Vasya's friend Petya might visit and ask how many stars are visible within a certain region of these cubes.
Input
The first line of the input contains a natural number 1 ≤ n ≤ 128. The coordinates of the cubes range from 0 to n-1. The subsequent lines describe events, one per line. Each line begins with a number m. If m is:
1, it is followed by 4 numbers: x, y, z (0 ≤ x, y, z < n) and k (-20000 ≤ k ≤ 20000). These represent the coordinates of a cube and the change in the number of visible stars within it.
2, it is followed by 6 numbers: x_1, y_1, z_1, x_2, y_2, z_2 (0 ≤ x_1 ≤ x_2 < n, 0 ≤ y_1 ≤ y_2 < n, 0 ≤ z_1 ≤ z_2 < n). This indicates that Petya wants to know the total number of stars in the cubes within the region defined by: x_1 ≤ x ≤ x_2, y_1 ≤ y ≤ y_2, z_1 ≤ z ≤ z_2.
3, it signifies that Vasya has grown tired of observing stars and answering Petya's questions. This entry appears only once and is the final record in the input.
The input file contains no more than 100002 records.
Output
For each of Petya's inquiries, output a single number on a separate line, representing the number of stars in the specified region.