



def      lowerCAmelCase__		(   lowerCamelCase_		:		str	,lowerCamelCase_		:		str):





				'''simple docstring'''

				def get_matched_characters(lowerCamelCase_		:		str	,lowerCamelCase_		:		str) -> str:
								lowerCAmelCase__					:    List[Any]												=					[]
								lowerCAmelCase__					:    List[str]												=					min(len(_stra)	,len(_stra)) // 2
								for i, l in enumerate(_stra):
												lowerCAmelCase__					:    Optional[Any]												=					int(max(0	,i - limit))
												lowerCAmelCase__					:    List[Any]												=					int(min(i + limit + 1	,len(_stra)))
												if l in _stra[left:right]:
																matched.append(a_)
																lowerCAmelCase__					:    str												=					f"""{_stra[0:_stra.index(a_)]} {_stra[_stra.index(a_) + 1:]}"""

								return "".join(a_)

				# matching characters
				lowerCAmelCase__					:    Optional[int]												=					get_matched_characters(a_	,a_)
				lowerCAmelCase__					:    Dict												=					get_matched_characters(a_	,a_)
				lowerCAmelCase__					:    List[str]												=					len(a_)

				# transposition
				lowerCAmelCase__					:    List[Any]												=					(
				    len([(ca, ca) for ca, ca in zip(a_	,a_) if ca != ca]) // 2
				)

				if not match_count:
								lowerCAmelCase__					:    List[Any]												=					0.0
				else:
								lowerCAmelCase__					:    Optional[Any]												=					(
								    1
								    / 3
								    * (
								        match_count / len(a_)
								        + match_count / len(a_)
								        + (match_count - transpositions) / match_count
								    )
								)

				# common prefix up to 4 characters
				lowerCAmelCase__					:    List[Any]												=					0
				for ca, ca in zip(stra[:4]	,stra[:4]):
								if ca == ca:
												prefix_len += 1
								else:
												break

				return jaro + 0.1 * prefix_len * (1 - jaro)


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							print(jaro_winkler('hello', 'world'))






def      lowerCAmelCase__		(   lowerCamelCase_		:		int = 1000):





				'''simple docstring'''

				lowerCAmelCase__						,		lowerCAmelCase__					:    int												=					1, 1
				lowerCAmelCase__					:    Any												=					2
				while True:
								lowerCAmelCase__					:    Optional[Any]												=					0
								lowerCAmelCase__					:    Any												=					fa + fa
								lowerCAmelCase__						,		lowerCAmelCase__					:    Optional[Any]												=					fa, f
								index += 1
								for _ in str(lowerCamelCase_):
												i += 1
								if i == n:
												break
				return index


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

