





from math import loga



def A_	(		A__				)  ->		int:
       if a < 0:
              raise ValueError('Input value must be a positive integer'				)
       elif isinstance(A__		,      A__				):
              raise TypeError('Input value must be a \'int\' type'				)
       return 0 if (a == 0) else int(loga(a & -a				)				)


if __name__ == "__main__":
    import doctest

    doctest.testmod()



'''simple docstring'''




from math import sqrt






def 				snake_case__							(			_A:					int = 1000000 )    ->	int:

		'''simple docstring'''


		lowerCAmelCase   					=  0
		lowerCAmelCase   					=  0
		lowerCAmelCase   					=  42

		while num_cuboids <= limit:
				max_cuboid_size += 1
				for sum_shortest_sides in range(2      ,   2 * max_cuboid_size + 1 ):
						if sqrt(sum_shortest_sides**2 + max_cuboid_size**2 ).is_integer():
								num_cuboids += (
								    min(_A      ,   sum_shortest_sides // 2 )
								    - max(1      ,   sum_shortest_sides - max_cuboid_size )
								    + 1
								)

		return max_cuboid_size


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




