




"""simple docstring"""
def 				__lowerCAmelCase					(					__lowerCAmelCase			:		int = 4000000						)    ->       Any:






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


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





'''simple docstring'''







def   lowerCAmelCase(  a__    :  float      , a__    :  float      , a__    :  int      ):







       '''simple docstring'''






       lowerCamelCase__				   =      [1 / first_term]
       lowerCamelCase__				   =      1 / first_term
       for _ in range(number_of_terms - 1      ):
              first_term += common_difference
              arithmetic_progression.append(a__      )
       lowerCamelCase__				   =      [1 / step for step in arithmetic_progression]
       return sum(a__      )


if __name__ == "__main__":
    import doctest

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

