
Find the number of different polygonal chains of minimal length that connect the origin to the point M(x, y), where each consecutive segment is perpendicular to the previous one and each segment has unit length.
Two integers — the coordinates of point M(x, y), where -20 \le x, y \le 20.
Print the number of possible polygonal chains of minimal length.
Example 1