def solution(numbers):
    numbers = sorted(numbers, reverse=True)

    divisibleByThree = list(filter(
        divisible(modulus=3, remainder=0), numbers))
    withRemainderOne = list(filter(
        divisible(modulus=3, remainder=1), numbers))
    withRemainderTwo = list(filter(
        divisible(modulus=3, remainder=2), numbers))

    result = []
    result.extend(divisibleByThree)
    
    while len(withRemainderOne) >= 2 and len(withRemainderTwo) >= 2:
        n1 = withRemainderOne[:1]
        del withRemainderOne[:1]
        result.extend(n1)

        n2 = withRemainderTwo[:1]
        del withRemainderTwo[:1]
        result.extend(n2)

    while len(withRemainderOne) >= 3:
        n = withRemainderOne[:3]
        del withRemainderOne[:3]
        result.extend(n)

    while len(withRemainderTwo) >= 3:
        n = withRemainderTwo[:3]
        del withRemainderTwo[:3]
        result.extend(n)
    
    while len(withRemainderOne) >= 1 and len(withRemainderTwo) >= 1:
        n1 = withRemainderOne[:1]
        del withRemainderOne[:1]
        result.extend(n1)

        n2 = withRemainderTwo[:1]
        del withRemainderTwo[:1]
        result.extend(n2)

    if len(result) == 0:
        return 0

    result = sorted(result, reverse=True)
    return format(result)

def divisible(modulus, remainder):
    return lambda x: x % modulus == remainder

def format(numbers):
    return int("".join(map("{:.0f}".format, numbers)))

n1 = withRemainderOne[:1]
        del withRemainderOne[:1]
        result.extend(n1)