using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {

    static void Main(String[] args) {
        int[][] grid = new int[20][];
        for(int grid_i = 0; grid_i < 20; grid_i++){
        	string[] grid_temp = Console.ReadLine().Split(' ');
        	grid[grid_i] = Array.ConvertAll(grid_temp,Int32.Parse);
            
        }
        Console.WriteLine(ProductOfNumbers(grid));
    }
    
    static long ProductOfNumbers(int[][] grid)
    {
            long product = 0;
            for (int i = 0; i < grid.Length; i++)
            {
                for (int j = 0; j < grid.Length; j++)
                {
                    var arr = new long[6];
                    var r = grid.Length-3;
                    // Horizontally 
                    if (j < r)
                        arr[0] = grid[i][j] * grid[i][j + 1] * grid[i][j + 2] * grid[i][j + 3];
                    
                    // Vertically
                    if (i < r)
                        arr[1] = grid[i][j] * grid[i + 1][j] * grid[i + 2][j] * grid[i + 3][j];
                    
                    // Diagonnally Right 
                    if (i < r && j < r)
                        arr[2] = grid[i][j] * grid[i + 1][j + 1] * grid[i + 2][j + 2] * grid[i + 3][j + 3];
                    
                    // Diagonnally 
                    if (i >= 3 && j >= 3 && i<r)
                    {
                        // Left Down
                        arr[3] = grid[i][j] * grid[i + 1][j - 1] * grid[i + 2][j - 2] * grid[i + 3][j-3];
                        
                        // Right Up
                        if(j<r)
                            arr[4] = grid[i][j]*grid[i-1][j+1]*grid[i-2][j+2]*grid[i-3][j+3];
                        
                    }

                    arr[5] = product;

                    product = arr.Max();
                }
            }
            
        return product;
    }
}