





def 							SCREAMING_SNAKE_CASE__  (			__a = 10_00      ):
	snake_case_						:	List[str]      =		2**power
	snake_case_						:	Tuple      =		0
	while n:
		snake_case_  ,snake_case_						:	int      =		r + n % 10, n // 10
	return r


if __name__ == "__main__":
						print(solution(int(str(input()).strip())))


"""simple docstring"""






def 			UpperCAmelCase__       (				lowerCAmelCase__     :str					,		lowerCAmelCase__     :Optional[Any]		) ->    int:
      '''simple docstring'''


      lowercase														=	[0 for i in range(r + 1		)]
      # nc0 = 1
      lowercase														=	1
      for i in range(1					,		n + 1		):
            # to compute current row from previous row.
            lowercase														=	min(lowerCAmelCase__					,		lowerCAmelCase__		)
            while j > 0:
                  c[j] += c[j - 1]
                  j -= 1
      return c[r]






print(binomial_coefficient(n=1_0, r=5))



