





snake_case_           =      {
    0: '0',
    1: '1',
    2: '2',
    3: '3',
    4: '4',
    5: '5',
    6: '6',
    7: '7',
    8: '8',
    9: '9',
    10: 'a',
    11: 'b',
    12: 'c',
    13: 'd',
    14: 'e',
    15: 'f',
}






def lowerCamelCase__   (							snake_case_     :  float	)				->    str:
   assert type(snake_case_	) in (int, float) and decimal == int(snake_case_	)
   __snake_case								=       int(snake_case_	)
   __snake_case								=       ''''''
   __snake_case								=       False
   if decimal < 0:
      __snake_case								=       True
      decimal *= -1
   while decimal > 0:
      __snake_case	,     __snake_case								=       divmod(snake_case_	,				16	)
      __snake_case								=       values[remainder] + hexadecimal
   __snake_case								=       '''0x''' + hexadecimal
   if negative:
      __snake_case								=       '''-''' + hexadecimal
   return hexadecimal


if __name__ == "__main__":
    import doctest

    doctest.testmod()










def lowerCamelCase__   (							snake_case_     :  int = 1000	)				->    int:
   __snake_case								=       2**power
   __snake_case								=       str(snake_case_	)
   __snake_case								=       list(snake_case_	)
   __snake_case								=       0

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

   return sum_of_num


if __name__ == "__main__":
    snake_case_           =      int(input('Enter the power of 2: ').strip())
    print('2 ^ ', power, ' = ', 2**power)
    snake_case_           =      solution(power)
    print('Sum of the digits is: ', result)

