

def 					__lowercase      (     _A						,    _A			)     ->						bool:
      SCREAMING_SNAKE_CASE :      Union[str, Any]       =   len(_A			)
      SCREAMING_SNAKE_CASE :      Union[str, Any]       =   [[False] * (required_sum + 1) for _ in range(arr_len + 1			)]

      # for each arr value, a sum of zero(0) can be formed by not taking any element
      # hence True/1
      for i in range(arr_len + 1			):
            SCREAMING_SNAKE_CASE :      Tuple       =   True

      # sum is not zero and set is empty then false
      for i in range(1						,    required_sum + 1			):
            SCREAMING_SNAKE_CASE :      Tuple       =   False

      for i in range(1						,    arr_len + 1			):
            for j in range(1						,    required_sum + 1			):
                  if arr[i - 1] > j:
                        SCREAMING_SNAKE_CASE :      Dict       =   subset[i - 1][j]
                  if arr[i - 1] <= j:
                        SCREAMING_SNAKE_CASE :      Union[str, Any]       =   subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

      return subset[arr_len][required_sum]


if __name__ == "__main__":
  import doctest

  doctest.testmod()







from math import ceil






def 					__lowercase      (     _A = 1001			)     ->						int:
      SCREAMING_SNAKE_CASE :      Union[str, Any]       =   1

      for i in range(1						,    int(ceil(n / 2.0			)			)			):
            SCREAMING_SNAKE_CASE :      Dict       =   2 * i + 1
            SCREAMING_SNAKE_CASE :      Optional[int]       =   2 * i
            SCREAMING_SNAKE_CASE :      str       =   total + 4 * odd**2 - 6 * even

      return total


if __name__ == "__main__":
  import sys

  if len(sys.argv) == 1:
    print(solution())
  else:
    try:
      UpperCAmelCase__ :     str				    =    int(sys.argv[1])
      print(solution(n))
    except ValueError:
      print("""Invalid entry - please enter a number""")




