



"""simple docstring"""







class       UpperCamelCase  :





     """simple docstring"""






     def __init__(					self :							List[str] ):
          A__				=   []
          A__				=   0
          A__				=   0





     def __str__(					self :							Union[str, Any] ):
          A__				=   '''<''' + str(self.entries )[1:-1] + '''>'''
          return printed





     def 						A__  (					self :							Union[str, Any]	,      _lowerCamelCase :							Optional[int] ):
          self.entries.append(_lowerCamelCase )
          A__				=   self.length + 1





     def 						A__  (					self :							Optional[Any] ):
          A__				=   self.length - 1
          A__				=   self.entries[self.front]
          # self.front-=1
          # self.entries = self.entries[self.front:]
          A__				=   self.entries[1:]
          return dequeued





     def 						A__  (					self :							int	,      _lowerCamelCase :							int ):
          for _ in range(_lowerCamelCase ):
               self.put(self.get() )





     def 						A__  (					self :							Union[str, Any] ):
          return self.entries[0]





     def 						A__  (					self :							List[str] ):
          return self.length










"""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())



