



"""simple docstring"""







def   a_	(			__a = 1000      ):
     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() = }')










"""simple docstring"""







from math import factorial



def   a_	(			__a		,							__a      ):
     return factorial(__a      ) / (factorial(__a      ) * factorial(n - r      ))



def   a_	(			):
     A__				=   0

     for i in range(1		,							101      ):
          for j in range(1		,							i + 1      ):
               if combinations(__a		,							__a      ) > 1e6:
                    total += 1
     return total


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



