
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() = }""")


def    __UpperCamelCase     (				lowerCAmelCase__							:				str  ):
 if n_term == "":
  return []
 __a :  list						=  []
 for temp in range(int(lowerCAmelCase__  )  ):
  series.append(f"1/{temp + 1}" if series else '''1'''  )
 return series


if __name__ == "__main__":
      lowercase__       =input('Enter the last number (nth term) of the Harmonic Series')
      print('Formula of Harmonic Series => 1+1/2+1/3 ..... 1/n')
      print(harmonic_series(nth_term))
