====== 알파벳 블록 ======

===== 풀이 =====
  * 풀이는 [[https://github.com/ssu-sccc/2025scon/blob/main/editorial-slide.pdf|에디토리얼]] 참고
  * 시간복잡도는 O(1)

===== 코드 =====
<dkpr py>
"""Solution code for "BOJ 33909. 알파벳 블록".

- Problem link: https://www.acmicpc.net/problem/33909
- Solution link: http://www.teferi.net/ps/problems/boj/33909
"""


def main():
    bS, bC, bO, bN = [int(x) for x in input().split()]

    s_count = bS + bN
    c_count = bC + bO * 2
    print(min(s_count // 3, c_count // 6))


if __name__ == '__main__':
    main()
</dkpr>

{{tag>BOJ ps:problems:boj:브론즈_3}}