One day Petya got a set of wooden cubes as a present from his mom. Petya immediately built a whole city from these cubes.

The base of the city is an *n* × *n* square, divided into unit squares. The square's sides are parallel to the coordinate axes, the square's opposite corners have coordinates (0, 0) and (*n*, *n*). On each of the unit squares Petya built a tower of wooden cubes. The side of a wooden cube also has a unit length.

After that Petya went an infinitely large distance away from his masterpiece and looked at it in the direction of vector *v* = (*v*<sub class="lower-index">*x*</sub>, *v*<sub class="lower-index">*y*</sub>, 0). Petya wonders, how many distinct cubes are visible from this position. Help him, find this number.

Each cube includes the border. We think that a cube is visible if there is a ray emanating from some point *p*, belonging to the cube, in the direction of vector  - *v*, that doesn't contain any points, belonging to other cubes.
The first line contains three integers *n*, *v*<sub class="lower-index">*x*</sub> and *v*<sub class="lower-index">*y*</sub> (1 ≤ *n* ≤ 10<sup class="upper-index">3</sup>, |*v*<sub class="lower-index">*x*</sub>|, |*v*<sub class="lower-index">*y*</sub>| ≤ |10<sup class="upper-index">4</sup>|, |*v*<sub class="lower-index">*x*</sub>| + |*v*<sub class="lower-index">*y*</sub>| &gt; 0).

Next *n* lines contain *n* integers each: the *j*-th integer in the *i*-th line *a*<sub class="lower-index">*ij*</sub> (0 ≤ *a*<sub class="lower-index">*ij*</sub> ≤ 10<sup class="upper-index">9</sup>, 1 ≤ *i*, *j* ≤ *n*) represents the height of the cube tower that stands on the unit square with opposite corners at points (*i* - 1, *j* - 1) and (*i*, *j*).
print("_RANDOM_GUESS_1689175427.060132")# 1689175427.0602062