






"""simple docstring"""






import unittest

from transformers import load_tool

from .test_tools_common import ToolTesterMixin




class 							lowerCAmelCase__				(			unittest.TestCase				,		UpperCAmelCase__ ):






      '''simple docstring'''

      def _SCREAMING_SNAKE_CASE (						self     :  Dict):




          '''simple docstring'''


          SCREAMING_SNAKE_CASE_      :  Optional[Any]    						=		load_tool('''text-classification''')
          self.tool.setup()
          SCREAMING_SNAKE_CASE_      :  Tuple    						=		load_tool('''text-classification'''						,	remote=lowercase_)
      def _SCREAMING_SNAKE_CASE (						self     :  int):




          '''simple docstring'''


          SCREAMING_SNAKE_CASE_      :  Dict    						=		self.tool('''That\'s quite cool'''						,	['''positive''', '''negative'''])
          self.assertEqual(lowercase_						,	'''positive''')
      def _SCREAMING_SNAKE_CASE (						self     :  Any):




          '''simple docstring'''


          SCREAMING_SNAKE_CASE_      :  List[Any]    						=		self.remote_tool('''That\'s quite cool'''						,	['''positive''', '''negative'''])
          self.assertEqual(lowercase_						,	'''positive''')
      def _SCREAMING_SNAKE_CASE (						self     :  List[Any]):




          '''simple docstring'''


          SCREAMING_SNAKE_CASE_      :  str    						=		self.tool(text='''That\'s quite cool'''						,	labels=['''positive''', '''negative'''])
          self.assertEqual(lowercase_						,	'''positive''')



      def _SCREAMING_SNAKE_CASE (						self     :  List[Any]):




          '''simple docstring'''


          SCREAMING_SNAKE_CASE_      :  Dict    						=		self.remote_tool(text='''That\'s quite cool'''						,	labels=['''positive''', '''negative'''])
          self.assertEqual(lowercase_						,	'''positive''')










"""simple docstring"""






from math import factorial



def 					_A			(__a = 20							) ->       int:
    """simple docstring"""






    SCREAMING_SNAKE_CASE_      :  Dict    						=		2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
    # 2, 3,...
    SCREAMING_SNAKE_CASE_      :  List[str]    						=		n // 2

    return int(factorial(__a							) / (factorial(__a							) * factorial(n - k							))							)


if __name__ == "__main__":
  import sys

  if len(sys.argv) == 1:
    print(solution(20))
  else:
    try:
      UpperCAmelCase_   : List[str]   			= int(sys.argv[1])
      print(solution(n))
    except ValueError:
      print("""Invalid entry - please enter a number.""")


