

def    _UpperCAmelCase    (					_SCREAMING_SNAKE_CASE   :						int = 1_000    ):





    """simple docstring"""


    SCREAMING_SNAKE_CASE_													=  0
    SCREAMING_SNAKE_CASE_													=  (n - 1) // 3
    total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
    SCREAMING_SNAKE_CASE_													=  (n - 1) // 5
    total += ((terms) * (10 + (terms - 1) * 5)) // 2
    SCREAMING_SNAKE_CASE_													=  (n - 1) // 15
    total -= ((terms) * (30 + (terms - 1) * 15)) // 2
    return total


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





def    _UpperCAmelCase    (					_SCREAMING_SNAKE_CASE   :						int	,				_SCREAMING_SNAKE_CASE   :						int	,				_SCREAMING_SNAKE_CASE   :						int    ):





    """simple docstring"""


    if power < 0:
        return -1
    base %= mod
    SCREAMING_SNAKE_CASE_													=  1

    while power > 0:
        if power & 1:
            SCREAMING_SNAKE_CASE_													=  (result * base) % mod
        SCREAMING_SNAKE_CASE_													=  power >> 1
        SCREAMING_SNAKE_CASE_													=  (base * base) % mod

    return result


def    _UpperCAmelCase    (					):





    """simple docstring"""


    print(modular_exponential(3	,				200	,				13    )    )


if __name__ == "__main__":
       import doctest

       doctest.testmod()

       main()


