


def SCREAMING_SNAKE_CASE	(			__lowerCAmelCase = 100				)    ->				int:
  snake_case__						= set()

  snake_case__						= 0

  snake_case__						= n + 1  # maximum limit

  for a in range(2							,   __lowerCAmelCase				):
    for b in range(2							,   __lowerCAmelCase				):
      snake_case__						= a**b  # calculates the current power
      collect_powers.add(__lowerCAmelCase				)  # adds the result to the set
  return len(__lowerCAmelCase				)


if __name__ == "__main__":
   print("""Number of terms """, solution(int(str(input()).strip())))



from math import isqrt





def      lowerCamelCase_					(							lowerCamelCase__       ):
				lowerCamelCase_         =     [True] * max_number
				for i in range(2      ,					isqrt(max_number - 1       ) + 1       ):
								if is_prime[i]:
												for j in range(i**2      ,					lowerCamelCase__      ,					lowerCamelCase__       ):
																lowerCamelCase_         =     False

				return [i for i in range(2      ,					lowerCamelCase__       ) if is_prime[i]]





def      lowerCamelCase_					(							lowerCamelCase__ = 1_0**8       ):
				lowerCamelCase_         =     calculate_prime_numbers(max_number // 2       )

				lowerCamelCase_         =     0
				lowerCamelCase_         =     0
				lowerCamelCase_         =     len(lowerCamelCase__       ) - 1
				while left <= right:
								while prime_numbers[left] * prime_numbers[right] >= max_number:
												right -= 1
								semiprimes_count += right - left + 1
								left += 1

				return semiprimes_count


if __name__ == "__main__":
			print(F"""{solution() = }""")


