

"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					int = 1000			):
     A__										=  2**power
     A__										=  str(UpperCAmelCase_			)
     A__										=  list(UpperCAmelCase_			)
     A__										=  0

     for i in list_num:
          sum_of_num += int(UpperCAmelCase_			)

     return sum_of_num


if __name__ == "__main__":
 SCREAMING_SNAKE_CASE_					:	List[Any]							  =						int(input('Enter the power of 2: ').strip())
 print('2 ^ ', power, ' = ', 2**power)
 SCREAMING_SNAKE_CASE_					:	Tuple							  =						solution(power)
 print('Sum of the digits is: ', result)









"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					Optional[Any]					,   UpperCAmelCase_  :					Optional[Any]			):
     A__										=  [0 for i in range(r + 1			)]
     # nc0 = 1
     A__										=  1
     for i in range(1					,   n + 1			):
          # to compute current row from previous row.
          A__										=  min(UpperCAmelCase_					,   UpperCAmelCase_			)
          while j > 0:
               c[j] += c[j - 1]
               j -= 1
     return c[r]

print(binomial_coefficient(n=1_0, r=5))






