






"""simple docstring"""



from collections import Counter
def 		_SCREAMING_SNAKE_CASE					(       __snake_case     :    list[int]       ):





  '''simple docstring'''





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


if __name__ == "__main__":
    import doctest

    doctest.testmod()

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










"""simple docstring"""



from __future__ import annotations

import random
from collections.abc import Iterable
from typing import Any, Generic, TypeVar

_UpperCamelCase						:    Optional[int]		=						TypeVar('T', bound=bool)

class 			a	(  Generic[T]      ):







    def __init__(     self				,						_lowerCamelCase			):
      lowercase				       =			value
      lowercase				       =			None
      lowercase				       =			None







    @property
    def      UpperCamelCase_ (     self			):
      return self._value







    @staticmethod
    def      UpperCamelCase_ (     _lowerCamelCase				,						_lowerCamelCase			):
      if not roota:
        return roota

      if not roota:
        return roota

      if roota.value > roota.value:
        lowercase       ,	lowercase				       =			roota, roota

      if random.choice([True, False]			):
        lowercase       ,	lowercase				       =			roota.right, roota.left

      lowercase				       =			RandomizedHeapNode.merge(roota.left				,						_lowerCamelCase			)

      return roota


class 			a	(  Generic[T]      ):







    def __init__(     self				,						_lowerCamelCase = ()			):
      lowercase				       =			None

      if data:
        for item in data:
          self.insert(_lowerCamelCase			)







    def      UpperCamelCase_ (     self				,						_lowerCamelCase			):
      lowercase				       =			RandomizedHeapNode.merge(self._root				,						RandomizedHeapNode(_lowerCamelCase			)			)







    def      UpperCamelCase_ (     self			):
      lowercase				       =			self.top()

      if self._root is None:
        return None

      lowercase				       =			RandomizedHeapNode.merge(self._root.left				,						self._root.right			)

      return result







    def      UpperCamelCase_ (     self			):
      if not self._root:
        raise IndexError('Can\'t get top element for the empty heap.'			)
      return self._root.value







    def      UpperCamelCase_ (     self			):
      lowercase				       =			None







    def      UpperCamelCase_ (     self			):
      lowercase				       =			[]
      while self:
        result.append(self.pop()			)

      return result







    def __bool__(     self			):
      return self._root is not None


if __name__ == "__main__":
    import doctest

    doctest.testmod()


