Let's introduce the operation of division with remainder on the ring of complex numbers with integer components. Let a be a dividend and b be a divisor. Then the result of the operation is any pair (q, r) satisfying the following conditions:

1. b · q + r = a (here “·” and “+” are standard operations of multiplication and addition of complex numbers)
2. |r| < |b|

It's evident that this operation is multivalued. You should output the number of different possible results of this operation for given dividend and divisor.

There are two input lines. Each of them contains two integers, which are real and imaginary parts of a complex number, respectively. The absolute values of all the numbers do not exceed 10⁶. The first line is the dividend and the second line is the divisor.

Output the number of different possible results of the above-described operation.