                                                                     
                                                                     
                                                                     
                                             

import math
def make_list(grid_str):
	grid = []
	for line in grid_str.split('\n'):
		grid.append(map(int, line.split(' ')))
	return grid

def greatest_prod_udd(grid, num):
	max_prod = 0
	r_len = len(grid[:])
	c_len = len(grid[0][:])
	for r in range(r_len):
		for c in range(c_len):
			r_free = False
			c_free = False
			if r <= r_len - num:
				tmp_list = get_entries_sq(r, r+num-1, c, c, grid)
				max_prod = update_prod(max_prod, tmp_list)
				r_free = True
			if c <= c_len - num:
				tmp_list = get_entries_sq(r, r, c, c+num-1, grid)
				max_prod = update_prod(max_prod, tmp_list)
				c_free = True
			if r_free == True and c_free == True:
				tmp_list = get_entries_diag(r, r+num-1, c, c+num-1, grid)
				max_prod = update_prod(max_prod, tmp_list)
			if r >= num-1 and c_free == True:
				tmp_list = get_entries_diag(r, r-num+1, c, c+num-1, grid)
				max_prod = update_prod(max_prod, tmp_list)	

	return max_prod

def get_entries_sq(rmin, rmax, cmin, cmax, grid):
	list = []
	for r in range(rmin, rmax+1):
		for c in range(cmin, cmax+1):
			list.append(grid[r][c])
	return list

def get_entries_diag(rmin, rmax, cmin, cmax, grid):
	list = []
	if rmin>rmax:
		rrange = range(rmin, rmax-1,-1)
	else:
		rrange = range(rmin, rmax+1)

	r_count = 0
	for r in rrange:
		c_count = 0
		for c in range(cmin, cmax+1):
			if r_count == c_count:
				list.append(grid[r][c])
			c_count = c_count + 1
		r_count = r_count + 1
	return list


def update_prod(old_prod, new_prod_list):

	new_prod = 1
	for i in range(len(new_prod_list)):
		new_prod = new_prod * new_prod_list[i]

	if new_prod > old_prod:
		return new_prod

	return old_prod
			

num = '08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08\n\
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00\n\
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65\n\
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91\n\
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80\n\
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50\n\
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70\n\
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21\n\
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72\n\
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95\n\
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92\n\
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57\n\
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58\n\
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40\n\
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66\n\
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69\n\
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36\n\
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16\n\
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54\n\
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48'

grid = make_list(num)
print greatest_prod_udd(grid,4)

