






def _UpperCAmelCase   (	a						:	int  ,					a						:	int ):
							return number | (1 << position)

def _UpperCAmelCase   (	a						:	int  ,					a						:	int ):
							return number & ~(1 << position)

def _UpperCAmelCase   (	a						:	int  ,					a						:	int ):
							return number ^ (1 << position)

def _UpperCAmelCase   (	a						:	int  ,					a						:	int ):
							return ((number >> position) & 1) == 1

def _UpperCAmelCase   (	a						:	int  ,					a						:	int ):
							return int((number & (1 << position)) != 0 )


if __name__ == "__main__":
	import doctest

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