Assume a Infinite 2-D grid, you always start from the cell (0, 0). You have to reach (X, Y) from (0, 0). \nYou can move from any cell (a, b) to any cell (c, d) if the following conditions are met:\n```\n1. c and d are integers.\n2. |a - c| + |b - d| = K\n```\nHere, the value of K is given in the input.\n\nFind if it is the possible to reach the destination (X, Y). If possible, what is the minimum number of moves you can take to reach the final destination?\n\nConstraints:\n```\n-10^5 <= X, Y <= 10^5\n1 <= K <= 10^9\n```\n\nExample:\n```\nInput:\n5\n1 3\nOutput:\n2\n```\n\nI\'m unable to solve this particular question. If anyone can able to solve it, please help me to understand the solution.

Assume a Infinite 2-D grid, you always start from the cell (0, 0). You have to reach (X, Y) from (0, 0). \nYou can move from any cell (a, b) to any cell (c, d) 