






def _UpperCAmelCase   (	a						:	list[int] ):
							snake_case__	  =       []
							if len(a ) == 1:
														return [nums.copy()]
							for _ in range(len(a ) ):
														snake_case__	  =       nums.pop(0 )
														snake_case__	  =       permute(a )
														for perm in permutations:
																					perm.append(a )
														result.extend(a )
														nums.append(a )
							return result

def _UpperCAmelCase   (	a						:	List[str] ):

							def backtrack(a						:	int ):
														if start == len(a ) - 1:
																					output.append(nums[:] )
														else:
																					for i in range(a  ,					len(a ) ):
																												snake_case__  , snake_case__	  =       nums[i], nums[start]
																												backtrack(start + 1 )
																												snake_case__  , snake_case__	  =       nums[i], nums[start]  # backtrack

							snake_case__	  =       []
							backtrack(0 )
							return output


if __name__ == "__main__":
	import doctest

	# use res to print the data in permute2 function
	a__       =     permutea([1, 2, 3])
	print(res)
	doctest.testmod()








def _UpperCAmelCase   (	a						:	int = 1000 ):
							snake_case__  , snake_case__	  =       1, 1
							snake_case__	  =       2
							while True:
														snake_case__	  =       0
														snake_case__	  =       fa + fa
														snake_case__  , snake_case__	  =       fa, f
														index += 1
														for _ in str(a ):
																					i += 1
														if i == n:
																					break
							return index


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