# prepared by Deniz Aydın

try:
    # tries to read triangle.txt for the input triangle

    file = open('triangle.txt', 'r')
    rawTriangle = file.read()

    # turn raw input to formatted matrix for further operations

    formattedTriangle = rawTriangle.split('\n')
    for i in range(0, len(formattedTriangle)):
        formattedTriangle[i] = formattedTriangle[i].split(" ")
except:
    # if it fails to read any files it will assume given raw triangle as default

    rawTriangle = '''215
193 124
117 237 442
218 935 347 235
320 804 522 417 345
229 601 723 835 133 124
248 202 277 433 207 263 257
359 464 504 528 516 716 871 182
461 441 426 656 863 560 380 171 923
381 348 573 533 447 632 387 176 975 449
223 711 445 645 245 543 931 532 937 541 444
330 131 333 928 377 733 017 778 839 168 197 197
131 171 522 137 217 224 291 413 528 520 227 229 928
223 626 034 683 839 053 627 310 713 999 629 817 410 121
924 622 911 233 325 139 721 218 253 223 107 233 230 124 233'''

    formattedTriangle = rawTriangle.split('\n')
    for i in range(0, len(formattedTriangle)):
        formattedTriangle[i] = formattedTriangle[i].split(" ")


def isPrime(x):
    # simple function to check if the given number is prime number
    if (x <= 1):
        return False
    for i in range(2, x):
        if (x % i == 0):
            return False
    return True


def getRidOfPrimes(triangle):
    # getting rid of the prime number by setting them the lowest possible integer

    for i in range(0, len(triangle)):
        for j in range(0, i + 1):
            if isPrime(int(triangle[i][j])):
                triangle[i][j] = -2147483647


def pathFind(triangle, layer):
    # Starting from bottom for every node selects the highest sum possible from its child nodes
    # Sums it with the current total and iterates this until it reaches the layer 0

    for i in range(layer - 1, -1, -1):  # from bottom to top
        for j in range(i + 1):  # from left to right
            if int(triangle[i + 1][j]) > int(triangle[i + 1][j + 1]):
                triangle[i][j] = int(triangle[i][j]) + int(triangle[i + 1][j])
            elif int(triangle[i + 1][j + 1]) >= int(triangle[i + 1][j]):
                triangle[i][j] = int(triangle[i][j]) + int(triangle[i + 1][j + 1])

    return triangle[0][0]


getRidOfPrimes(formattedTriangle)
print(pathFind(formattedTriangle, len(formattedTriangle) - 1))