import re
from collections import deque, Counter, defaultdict
from heapq import heappop, heappush
from itertools import compress, combinations, chain, permutations

from output import matrix, D, DD, ADJ, ints, mhd, mdbg, vdbg, cw, ccw, bk


def solve(data):
    E = data.split("\n\n")
    p1 = 0
    C = []
    for e in E:
        e = sum(ints(e))
        p1 = max(p1, e)
        C.append(e)
    p2 = sum(sorted(C, reverse=True)[:3])
    return p1, p2


if __name__ == "__main__":
    import os

    with open("./input/01.txt", "r") as f:
        inp = f.read().strip()

    p1, p2 = solve(inp)

    print(p1)
    print(p2)

    assert p1 == 66616
    assert p2 == 199172