
def    _a (						lowerCamelCase = 400_0000							):

 if n <= 1:
  return 0
 lowerCamelCase		:     Dict          =				0
 lowerCamelCase		:     Optional[int]          =				2
 lowerCamelCase		:     Tuple          =				0
 while 4 * b + a <= n:
  lowerCamelCase		:     Union[str, Any]          =				b, 4 * b + a
  count += a
 return count + b


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






def    _a (						lowerCamelCase,     lowerCamelCase,     lowerCamelCase							):
 lowerCamelCase		:     Optional[int]          =				[1 / first_term]
 lowerCamelCase		:     Any          =				1 / first_term
 for _ in range(number_of_terms - 1							):
  first_term += common_difference
  arithmetic_progression.append(lowerCamelCase							)
 lowerCamelCase		:     Optional[Any]          =				[1 / step for step in arithmetic_progression]
 return sum(lowerCamelCase							)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      print(sum_of_harmonic_progression(1 / 2, 2, 2))




