


"""simple docstring"""




def     __a   (	a       ):





       """simple docstring"""







       _a							 =					1
       _a							 =					2
       while i * i <= n:
              _a							 =					0
              while n % i == 0:
                     n //= i
                     multiplicity += 1
              n_divisors *= multiplicity + 1
              i += 1
       if n > 1:
              n_divisors *= 2
       return n_divisors



def     __a   (	):





       """simple docstring"""







       _a							 =					1
       _a							 =					1

       while True:
              i += 1
              t_num += i

              if count_divisors(_UpperCamelCase       ) > 5_0_0:
                     break

       return t_num


if __name__ == "__main__":
   print(solution())





from __future__ import annotations





def 		a__      (		_UpperCamelCase      :			int | float | str			,_UpperCamelCase      :			int | float | str				):
   if nth_term == "":
      return [""]
   __lowerCamelCase    				=     int(_UpperCamelCase				)
   __lowerCamelCase    				=     int(_UpperCamelCase				)
   __lowerCamelCase    				=     []
   for temp in range(int(_UpperCamelCase				)				):
      series.append(F"""1 / {pow(temp + 1			,int(_UpperCamelCase				)				)}""" if series else '''1'''				)
   return series


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a_								=       int(input("""Enter the last number (nth term) of the P-Series"""))
  a_								=       int(input("""Enter the power for  P-Series"""))
  print("""Formula of P-Series => 1+1/2^p+1/3^p ..... 1/n^p""")
  print(p_series(nth_term, power))






