
def       A       (					lowercase = 4_000_000 )   ->  int:
		'''simple docstring'''

		UpperCamelCase		=     [0, 1]
		UpperCamelCase		=     0
		while fib[i] <= n:
				fib.append(fib[i] + fib[i + 1] )
				if fib[i + 2] > n:
						break
				i += 1
		UpperCamelCase		=     0
		for j in range(len(lowercase ) - 1 ):
				if fib[j] % 2 == 0:
						total += fib[j]

		return total


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


from unittest import TestCase

from datasets import Dataset
from minhash_deduplication import deduplicate_dataset, make_duplicate_clusters


def       A       (					)   ->  Union[str, Any]:
		'''simple docstring'''

		UpperCamelCase		=     {
		    'repo_name': ['test_repo1', 'test_repo2', 'test_repo3'],
		    'path': ['test_1.py', 'test_2.py', 'unit_test.py'],
		    'content': ['a ' * 20, 'a ' * 30, 'b ' * 7],
		}
		UpperCamelCase		=     Dataset.from_dict(lowercase )
		return dataset


class 				lowercase					(		_SCREAMING_SNAKE_CASE   ):



		def __UpperCamelCase ( self       )  ->					Tuple:
				"""simple docstring"""
				UpperCamelCase		=     get_dataset()
				UpperCamelCase		=     make_duplicate_clusters(A_				,      0.85       )
				self.assertEqual(len(duplicate_clusters[0]       )				,      2       )



		def __UpperCamelCase ( self       )  ->					Any:
				"""simple docstring"""
				UpperCamelCase		=     get_dataset()
				UpperCamelCase	,  UpperCamelCase		=     deduplicate_dataset(A_       )
				self.assertEqual(len(A_       )				,      2       )
				print(A_       )
				self.assertEqual(duplicate_clusters[0][0]['copies']				,      2       )
				self.assertEqual(duplicate_clusters[0][0]['is_extreme']				,      A_       )
