




def 							__lowerCAmelCase			(UpperCAmelCase_ = 1_000		):
    a__  			=							0
    a__  			=							(n - 1) // 3
    total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
    a__  			=							(n - 1) // 5
    total += ((terms) * (10 + (terms - 1) * 5)) // 2
    a__  			=							(n - 1) // 15
    total -= ((terms) * (30 + (terms - 1) * 15)) // 2
    return total


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












import math


def   A		(__A  :       int			)  -> float:







     """simple docstring"""


     UpperCAmelCase_		=				math.log(2  ,							10			) * number
     UpperCAmelCase_		=				round((log_number - int(__A			))  ,							15			)

     return difference


def   A		(__A  :       int = 678910			)  -> int:







     """simple docstring"""


     UpperCAmelCase_		=				90
     UpperCAmelCase_		=				0

     UpperCAmelCase_		=				math.log(1.23  ,							10			)
     UpperCAmelCase_		=				math.log(1.24  ,							10			)
     UpperCAmelCase_		=				0

     while position < number:
          UpperCAmelCase_		=				log_difference(__A			)

          if difference >= upper_limit:
               power_iterator += 93

          elif difference < lower_limit:
               power_iterator += 196

          else:
               UpperCAmelCase_		=				power_iterator
               power_iterator += 196
               position += 1

     return previous_power


if __name__ == "__main__":
    import doctest

    doctest.testmod()

    print(f"{solution() = }")






