


"""simple docstring"""




from collections.abc import Generator

def        lowercase							(		) ->      Generator[int, None, None]:
		__a      ,     __a           =			0, 1
		while True:
				__a      ,     __a           =			b, a + b
				yield b

def        lowercase							(		lowerCAmelCase__ :     int = 1000			) ->      int:
		__a           =			1
		__a           =			fibonacci_generator()
		while len(str(next(lowerCAmelCase__			)			)			) < n:
				answer += 1
		return answer + 1


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










"""simple docstring"""




def        lowercase							(		lowerCAmelCase__ :     list			) ->      bool:
		if not isinstance(lowerCAmelCase__    ,					lowerCAmelCase__			):
				raise ValueError('''Input series is not valid, valid series - [2, 4, 6]'''			)
		if len(lowerCAmelCase__			) == 0:
				raise ValueError('''Input list must be a non empty list'''			)
		if len(lowerCAmelCase__			) == 1:
				return True
		__a           =			series[1] - series[0]
		for index in range(len(lowerCAmelCase__			) - 1			):
				if series[index + 1] - series[index] != common_diff:
						return False
		return True

def        lowercase							(		lowerCAmelCase__ :     list			) ->      float:
		if not isinstance(lowerCAmelCase__    ,					lowerCAmelCase__			):
				raise ValueError('''Input series is not valid, valid series - [2, 4, 6]'''			)
		if len(lowerCAmelCase__			) == 0:
				raise ValueError('''Input list must be a non empty list'''			)
		__a           =			0
		for val in series:
				answer += val
		return answer / len(lowerCAmelCase__			)


if __name__ == "__main__":
				import doctest

				doctest.testmod()






