There are `n` rabbits on a straight line of infinite length. The `x` coordinate and hop distance `h` of each rabbit is given in ascending order of `x`. A rabbit can either hop to `x + h` or `x - h` only if the new position is not occupied. Find the maximum number of rabbits that can hop at once.\n\n**Example:**\n```\nInput: n = 5, x = [1,2,5,10,19], h = [2,1,15,9,1]\nOutput: 3\n\nExplanation:\n\n1 -> 3\n2 -> No as 1 was occupied and 3 is occupied\n5 -> 20\n10 -> No as 1 and 19 are occupied\n19 -> 18\n\nNegative x coordinate is not allowed\n```\n\nThe question was not well explained in the OA, so this is what I have understood.\n\nThe output would be `4` if negative coordinates were allowed.\n\nHow to solve with and without the negative `x` coordinate constraint?

There are n rabbits on a straight line of infinite length. The x coordinate and hop distance h of each rabbit is given in ascending order of x. A rabbit can eit