


'''simple docstring'''







import random

from .binary_exp_mod import bin_exp_mod




def        __lowercase						(      __SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE=1000		)				->					Dict:
     """simple docstring"""




     if n < 2:
          return False

     if n % 2 == 0:
          return n == 2

     # this means n is odd
     __a       =   n - 1
     __a       =   0
     while d % 2 == 0:
          d /= 2
          exp += 1

     # n - 1=d*(2**exp)
     __a       =   0
     while count < prec:
          __a       =   random.randint(2				,  n - 1		)
          __a       =   bin_exp_mod(__SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE				,  __SCREAMING_SNAKE_CASE		)
          if b != 1:
               __a       =   True
               for _ in range(__SCREAMING_SNAKE_CASE		):
                    if b == n - 1:
                         __a       =   False
                         break
                    __a       =   b * b
                    b %= n
               if flag:
                    return False
               count += 1
     return True


if __name__ == "__main__":
 SCREAMING_SNAKE_CASE_      =			abs(int(input('Enter bound : ').strip()))
 print('Here\'s the list of primes:')
 print(', '.join(str(i) for i in range(n + 1) if is_prime_big(i)))










'''simple docstring'''







def        __lowercase						(      __SCREAMING_SNAKE_CASE = 100_0000		)				->					int:
     """simple docstring"""




     __a       =   1
     __a       =   1
     __a       =   {1: 1}

     for inputa in range(2				,  __SCREAMING_SNAKE_CASE		):
          __a       =   0
          __a       =   inputa

          while True:
               if number in counters:
                    counter += counters[number]
                    break
               if number % 2 == 0:
                    number //= 2
                    counter += 1
               else:
                    __a       =   (3 * number) + 1
                    counter += 1

          if inputa not in counters:
               __a       =   counter

          if counter > pre_counter:
               __a       =   inputa
               __a       =   counter
     return largest_number


if __name__ == "__main__":
 print(solution(int(input().strip())))






