






'''simple docstring'''



def 				lowercase_					(     __A			:							Tuple      )							->   Tuple:



 """simple docstring"""




 lowercase       : int						=len(__A      )
 lowercase       : int						=sum(__A      )

 lowercase       : List[Any]						=[[False for x in range(s + 1      )] for y in range(n + 1      )]

 for i in range(1       ,   n + 1      ):
  lowercase       : Optional[Any]						=True

 for i in range(1       ,   s + 1      ):
  lowercase       : Union[str, Any]						=False

 for i in range(1       ,   n + 1      ):
  for j in range(1       ,   s + 1      ):
   lowercase       : Union[str, Any]						=dp[i][j - 1]

   if arr[i - 1] <= j:
    lowercase       : Union[str, Any]						=dp[i][j] or dp[i - 1][j - arr[i - 1]]

 for j in range(int(s / 2      )       ,   -1       ,   -1      ):
  if dp[n][j] is True:
   lowercase       : Union[str, Any]						=s - 2 * j
   break

 return diff




'''simple docstring'''

from math import factorial, radians







def __UpperCamelCase( _A       :					float	,      _A       :					int = 18	,      _A       :					int = 10     ):
   '''simple docstring'''
   UpperCAmelCase__				:					int 					=	angle_in_degrees - ((angle_in_degrees // 3_6_0.0) * 3_6_0.0)

   # Converting from degrees to radians
   UpperCAmelCase__				:					Dict 					=	radians(_A     )

   UpperCAmelCase__				:					Union[str, Any] 					=	angle_in_radians
   UpperCAmelCase__				:					List[str] 					=	3
   UpperCAmelCase__				:					int 					=	-1

   for _ in range(_A     ):
      result += (b * (angle_in_radians**a)) / factorial(_A     )

      UpperCAmelCase__				:					List[str] 					=	-b  # One positive term and the next will be negative and so on...
      a += 2  # Increased by 2 for every term.

   return round(_A	,      _A     )


if __name__ == "__main__":
  __import__('doctest').testmod()




