UFOs#4914

UFOs

1 second
64 megabytes
Very easy

Vasya is a ufologist, and his duties include observing Unidentified Flying Objects (UFOs) in the part of space bounded by a cube N \times N \times N. The cube is divided into cubic sectors 1 \times 1 \times 1. During the observation, the following events may happen:

At the moment when Vasya starts his observations, there are no UFOs in the whole space.

Input

The first line contains an integer (1 \leq N \leq 128). The coordinates of sectors are integers from to N - 1.

Then there are entries describing events, one entry per line. Each entry starts with a number .

  • If is , then this number is followed by four integers (0 \leq x < N), (0 \leq y < N), (0 \leq z < N), (-20000 \leq K \leq 20000), which are the coordinates of a sector and the change in the number of UFOs in this sector. The number of UFOs in a sector cannot become negative.

  • If is , then this number is followed by six integers 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 mean that Vasya must compute the total number of UFOs in sectors (x, y, z) belonging to the volume: x_1 \leq x \leq x_2, y_1 \leq y \leq y_2, z_1 \leq z \leq z_2.

  • If is , it means that Vasya is tired and goes to sleep. This entry is always the last one.

The number of entries does not exceed .

Output

For each query, output on a separate line the required number of UFOs.

Examples

Example 1

Loading
Loading