using System;
using System.Collections.Generic;

class Program
{
   
    static bool IsPrime(int number)
    {
        if (number < 2) return false;
        if (number == 2) return true;
        if (number % 2 == 0) return false;
        int sqrt = (int)Math.Sqrt(number);
        for (int i = 3; i <= sqrt; i += 2)
        {
            if (number % i == 0) return false;
        }
        return true;
    }

    static void Main(string[] args)
    {
      
        string pyramidData = @"
        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
        ";

       
        List<List<int>> pyramid = new List<List<int>>();
        string[] lines = pyramidData.Trim().Split('\n');
        foreach (var line in lines)
        {
            var numbers = new List<int>();
            foreach (var num in line.Trim().Split(' ', StringSplitOptions.RemoveEmptyEntries))
            {
                if (int.TryParse(num, out int val))
                {
                    numbers.Add(val);
                }
            }
            pyramid.Add(numbers);
        }

        int n = pyramid.Count;

    
        int[,] dp = new int[n, n];

    
        for (int j = 0; j < pyramid[n - 1].Count; j++)
        {
            if (!IsPrime(pyramid[n - 1][j]))
                dp[n - 1, j] = pyramid[n - 1][j];
            else
                dp[n - 1, j] = int.MinValue; 
        }

      
        for (int i = n - 2; i >= 0; i--)
        {
            for (int j = 0; j < pyramid[i].Count; j++)
            {
                if (IsPrime(pyramid[i][j]))
                {
                    dp[i, j] = int.MinValue; 
                    continue;
                }

               
                int left = dp[i + 1, j];
                int right = dp[i + 1, j + 1];

                
                if (left == int.MinValue && right == int.MinValue)
                {
                    dp[i, j] = int.MinValue;
                }
                else
                {
                 
                    int maxBelow = Math.Max(left, right);
                    dp[i, j] = pyramid[i][j] + maxBelow;
                }
            }
        }

      
        if (dp[0, 0] == int.MinValue)
        {
            Console.WriteLine("Geçerli bir yol bulunamadı.");
        }
        else
        {
            Console.WriteLine("Maksimum Toplam: " + dp[0, 0]);
            Console.ReadLine();
        }
    }
}