using System;

using System.Text.RegularExpressions;

using System.Linq;

using System.IO;

using System.Collections.Generic;

​

public class Program

{

    public const string minput = @" 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";

    public static void Main()

    {

        var list = new List<double>(conv2list(minput));

        maxpath(list);

    }

​

    public static List<double> conv2list(string input)

    {

        double digit = 0;

        input = input + ' ';

        int inlenght = input.Length;

        int dcount = 0;

        var inputlist = new List<double>();

        var digits = new List<double>();

        for (int i = 0; i < input.Length; i++)

        {

            if (Char.IsDigit((input[i])))

            {

                digits.Add(Char.GetNumericValue(input[i]));

            }

            else

            {

                dcount = digits.Count;

                double sumdig = 0;

                int dp = 0;

                while (dcount != 0)

                {

                    digit = digits[dcount - 1] * Math.Pow(10, dp);

                    dcount--;

                    dp++;

                    sumdig = sumdig + digit;

                }

​

                if (digits.Count != 0)

                    inputlist.Add(sumdig);

                dcount = 0;

                digits.Clear();

            }

        }

​

        return inputlist;

    }

​

    public static double[, ] primeChange(double[, ] array)

    {

        double arrSum = -(

            from double val in array

            select val).Sum();

        int uBound0 = array.GetUpperBound(0);

        int uBound1 = array.GetUpperBound(1);

        Console.Write(uBound0);Console.Write(uBound1);

        for (int x = 0; x <= uBound0; x++)

        {

            for (int y = 0; y <= uBound1; y++)

            {

                if (array[x, y] == 2)

                {array[x, y] = arrSum;Console.Write("a");}

                var bound = Math.Floor(Math.Sqrt(array[x, y]));

                for (double i = 3; i <= bound; i += 2)

                {if (array[x, y] % i != 0)

                        array[x, y] = arrSum;

                }

                }

        }

​

        return array;

    }

​

    public static double[, ] maxpath(List<double> input)

    {

        int b = 0;

        int listline = 0;

        int c = 0;

        while (c != input.Count) //saves how many lines are in triangular sequance list to listline

        {

            c = b * (b + 1) / 2;

            listline++;

            b++;

        }

​

        double[] sumarray = new double[listline - 2];

        double[, ] array = new double[listline - 1, listline - 1];

        for (int i = 0; i < listline - 1; i++)

        {

            int ncount = ((i + 1) * (i + 2) / 2) - (i * (i + 1) / 2); //line number count

            int first = (i * (i + 1) / 2); //first number addres in line

            for (int a = 0; a < ncount; a++)

            {

                array[a, i] = input[first + a];

            }

        }

​

        array = primeChange(array);

        Console.WriteLine(array[0,0]);

        /*for (int i = 0; i < listline - 1; i++)

        {

            int sumcount = i * 2;

            if (sumcount == 0)

                sumcount = 2;

            Console.WriteLine(i);

            array[0, 1] = array[0, 0] + array[0, 1];

            array[1, 1] = array[0, 0] + array[1, 1];

            for (int a = 0; a < sumcount; a++)

            {

                Console.WriteLine(i + 1);

                array[a + 1, i + 1] = array[a, i] + array[a + 1, i + 1];

                array[a, i + 1] = array[a, i] + array[a, i + 1];

            }

        }*/

​

        return array;

    }

}