




'''simple docstring'''







def 						snake_case_							(_a	:							int = 1_0_0     ):
    UpperCAmelCase			       =		set()

    UpperCAmelCase			       =		0

    UpperCAmelCase			       =		n + 1  # maximum limit

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


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






def    __UpperCamelCase     (				lowerCAmelCase__							:				int = 5_0_0_0_0_0_0_0  ):
 __a :  int						=  set()
 __a :  str						=  int((limit - 2_4) ** (1 / 2)  )

 __a :  int						=  set(range(3  ,   prime_square_limit + 1  ,   2  )  )
 primes.add(2  )
 for p in range(3  ,   prime_square_limit + 1  ,   2  ):
  if p not in primes:
   continue
  primes.difference_update(set(range(p * p  ,   prime_square_limit + 1  ,   lowerCAmelCase__  )  )  )

 for primea in primes:
  __a :  Union[str, Any]						=  primea * primea
  for primea in primes:
   __a :  Union[str, Any]						=  primea * primea * primea
   if square + cube >= limit - 1_6:
    break
   for primea in primes:
    __a :  int						=  primea * primea * primea * primea
    __a :  Union[str, Any]						=  square + cube + tetr
    if total >= limit:
     break
    ret.add(lowerCAmelCase__  )

 return len(lowerCAmelCase__  )


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