def 				__lowerCamelCase		(						lowerCAmelCase__     ):
       lowerCAmelCase__					     = [[0 for _ in range(lowerCAmelCase__     )] for _ in range(m + 1     )]
       for i in range(m + 1     ):
              lowerCAmelCase__					     = 1

       for n in range(m + 1     ):
              for k in range(1     ,  lowerCAmelCase__     ):
                     memo[n][k] += memo[n][k - 1]
                     if n - k > 0:
                            memo[n][k] += memo[n - k - 1][k]

       return memo[m][m - 1]


if __name__ == "__main__":
    import sys

    if len(sys.argv) == 1:
        try:
            lowerCAmelCase__     						=			int(input('Enter a number: ').strip())
            print(partition(n))
        except ValueError:
            print('Please enter a number.')
    else:
        try:
            lowerCAmelCase__     						=			int(sys.argv[1])
            print(partition(n))
        except ValueError:
            print('Please pass a number.')

import numpy as np






def 				__lowerCamelCase		(						lowerCAmelCase__     ):
       return 1 / (1 + np.exp(-vector     ))






def 				__lowerCamelCase		(						lowerCAmelCase__     ):
       return vector * sigmoid(lowerCAmelCase__     )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
