


def 							__lowercase   ( __lowerCAmelCase							:				int = 1_0_0_0   ):
							a__             =     3
							a__             =     0
							while a < n:
														if a % 3 == 0 or a % 5 == 0:
																					result += a
														elif a % 1_5 == 0:
																					result -= a
														a += 1
							return result


if __name__ == "__main__":
						print(f"""{solution() = }""")








def 							__lowercase   ( __lowerCAmelCase							:				str					,    __lowerCAmelCase							:				str   ):

							def get_matched_characters(__lowerCAmelCase							:				str					,    __lowerCAmelCase							:				str   ) -> str:
														a__             =     []
														a__             =     min(len(_stra   )					,    len(_stra   )   ) // 2
														for i, l in enumerate(_stra   ):
																					a__             =     int(max(0					,    i - limit   )   )
																					a__             =     int(min(i + limit + 1					,    len(_stra   )   )   )
																					if l in _stra[left:right]:
																												matched.append(__lowerCAmelCase   )
																												a__             =     F'{_stra[0:_stra.index(__lowerCAmelCase   )]} {_stra[_stra.index(__lowerCAmelCase   ) + 1:]}'

														return "".join(__lowerCAmelCase   )

							# matching characters
							a__             =     get_matched_characters(__lowerCAmelCase					,    __lowerCAmelCase   )
							a__             =     get_matched_characters(__lowerCAmelCase					,    __lowerCAmelCase   )
							a__             =     len(__lowerCAmelCase   )

							# transposition
							a__             =     (
							    len([(ca, ca) for ca, ca in zip(__lowerCAmelCase					,    __lowerCAmelCase   ) if ca != ca]   ) // 2
							)

							if not match_count:
														a__             =     0.0
							else:
														a__             =     (
														    1
														    / 3
														    * (
														        match_count / len(__lowerCAmelCase   )
														        + match_count / len(__lowerCAmelCase   )
														        + (match_count - transpositions) / match_count
														    )
														)

							# common prefix up to 4 characters
							a__             =     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'''))




