


import math
from collections.abc import Generator




def   snake_case_	(    snake_case	)    ->							Dict:
       lowercase__:  str         =  (i for i in range(1     ,				(max_n + 1)	))
       for i in (n for n in numbers if n > 1):
              for j in range(2     ,				UpperCAmelCase__	):
                     if (i % j) == 0:
                            break
              else:
                     yield i




def   snake_case_	(    snake_case	)    ->							Optional[Any]:
       lowercase__:  Dict         =  (i for i in range(1     ,				(max_n + 1)	))
       for i in (n for n in numbers if n > 1):
              # only need to check for factors up to sqrt(i)
              lowercase__:  Optional[int]         =  int(math.sqrt(UpperCAmelCase__	)	) + 1
              for j in range(2     ,				UpperCAmelCase__	):
                     if (i % j) == 0:
                            break
              else:
                     yield i




def   snake_case_	(    snake_case	)    ->							str:
       lowercase__:  Tuple         =  (i for i in range(1     ,				(max_n + 1)     ,				2	))
       # It's useless to test even numbers as they will not be prime
       if max_n > 2:
              yield 2  # Because 2 will not be tested, it's necessary to yield it now
       for i in (n for n in numbers if n > 1):
              lowercase__:  int         =  int(math.sqrt(UpperCAmelCase__	)	) + 1
              for j in range(3     ,				UpperCAmelCase__     ,				2	):
                     # As we removed the even numbers, we don't need them now
                     if (i % j) == 0:
                            break
              else:
                     yield i




def   snake_case_	(    )    ->							List[Any]:
       from timeit import timeit

       lowercase__:  int         =  'from __main__ import slow_primes, primes, fast_primes'
       print(timeit('slow_primes(1_000_000_000_000)'     ,				setup=UpperCAmelCase__     ,				number=1_00_00_00	)	)
       print(timeit('primes(1_000_000_000_000)'     ,				setup=UpperCAmelCase__     ,				number=1_00_00_00	)	)
       print(timeit('fast_primes(1_000_000_000_000)'     ,				setup=UpperCAmelCase__     ,				number=1_00_00_00	)	)


if __name__ == "__main__":
 __lowerCAmelCase									=				int(input('''Calculate primes up to:\n>> ''').strip())
 for ret in primes(number):
  print(ret)
 benchmark()







from collections import Counter


def 						UpperCAmelCase__   (   UpperCAmelCase__			:list[int]       ):






 '''simple docstring'''

 return sum(socks_by_color // 2 for socks_by_color in Counter(UpperCAmelCase__       ).values()       )


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     A_		:  List[str]										=  [int(x) for x in input('''Enter socks by color :''').rstrip().split()]
     print(F"""sock_merchant({colors}) = {sock_merchant(colors)}""")

