
'''simple docstring'''






import math
import unittest





def    UpperCAmelCase							(  UpperCAmelCase__							:							int):
				assert isinstance(UpperCAmelCase__       ,							UpperCAmelCase__) and (
				    number >= 0
				), "'number' must been an int and positive"

				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5       ,							int(math.sqrt(UpperCAmelCase__) + 1)       ,							6):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True




class     __snake_case		(   unittest.TestCase):
					def     UpperCAmelCase_							(     self      ):

									"""simple docstring"""


									self.assertTrue(is_prime(2      )      )
									self.assertTrue(is_prime(3      )      )
									self.assertTrue(is_prime(5      )      )
									self.assertTrue(is_prime(7      )      )
									self.assertTrue(is_prime(11      )      )
									self.assertTrue(is_prime(13      )      )
									self.assertTrue(is_prime(17      )      )
									self.assertTrue(is_prime(19      )      )
									self.assertTrue(is_prime(23      )      )
									self.assertTrue(is_prime(29      )      )




					def     UpperCAmelCase_							(     self      ):

									"""simple docstring"""


									with self.assertRaises(A      ):
													is_prime(-19      )
									self.assertFalse(
									    is_prime(0      ),    'Zero doesn\'t have any positive factors, primes must have exactly two.',    )
									self.assertFalse(
									    is_prime(1      ),    'One only has 1 positive factor, primes must have exactly two.',    )
									self.assertFalse(is_prime(2 * 2      )      )
									self.assertFalse(is_prime(2 * 3      )      )
									self.assertFalse(is_prime(3 * 3      )      )
									self.assertFalse(is_prime(3 * 5      )      )
									self.assertFalse(is_prime(3 * 5 * 7      )      )


if __name__ == "__main__":
					unittest.main()


'''simple docstring'''






def    UpperCAmelCase							(  UpperCAmelCase__							:							int = 10_00):
				lowerCamelCase					:			Optional[Any]									= 2**power
				lowerCamelCase					:			str									= str(UpperCAmelCase__)
				lowerCamelCase					:			Union[str, Any]									= list(UpperCAmelCase__)
				lowerCamelCase					:			Optional[Any]									= 0

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

				return sum_of_num


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