





def    __lowerCamelCase					(							__a   :list[list[int]]    ,     __a   :int    ,     __a   :int    ,     __a   :set    )		->				int:






		"""simple docstring"""

		A__      ,			A__        =   len(__a    ), len(grid[0]    )
		if (
		    min(__a    ,     __a    ) < 0
		    or row == row_length
		    or col == col_length
		    or (row, col) in visit
		    or grid[row][col] == 1
		):
				return 0
		if row == row_length - 1 and col == col_length - 1:
				return 1

		visit.add((row, col)    )

		A__        =   0
		count += depth_first_search(__a    ,     row + 1    ,     __a    ,     __a    )
		count += depth_first_search(__a    ,     row - 1    ,     __a    ,     __a    )
		count += depth_first_search(__a    ,     __a    ,     col + 1    ,     __a    )
		count += depth_first_search(__a    ,     __a    ,     col - 1    ,     __a    )

		visit.remove((row, col)    )
		return count


if __name__ == "__main__":
					import doctest

					doctest.testmod()










def    __lowerCamelCase					(							__a   :int = 1_0_0_0_0_0_0    )		->				int:






		"""simple docstring"""

		A__        =   limit + 1
		A__        =   [0] * limit
		for first_term in range(1    ,     __a    ):
				for n in range(__a    ,     __a    ,     __a    ):
						A__        =   first_term + n / first_term
						if common_difference % 4:  # d must be divisble by 4
								continue
						else:
								common_difference /= 4
								if (
								    first_term > common_difference
								    and first_term < 4 * common_difference
								):  # since x,y,z are positive integers
										frequency[n] += 1  # so z>0 and a>d ,also 4d<a

		A__        =   sum(1 for x in frequency[1:limit] if x == 1_0    )

		return count


if __name__ == "__main__":
					print(F'''{solution() = }''')



