//baekjoon_20057_마법사상어와_토네이도

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main{
    static int n;
    static int sx, sy;
    static int total = 0;
    static int[] dx = {0, 1, 0, -1};
    static int[] dy = {-1, 0, 1, 0};
    static int[][] map;
    static int[][][] change= {
            {
                    {0, 0, 2, 0, 0},
                    {0, 10, 7, 1, 0},
                    {5, 0, 0, 0, 0},
                    {0, 10, 7, 1, 0},
                    {0, 0, 2, 0, 0}
            },
            {
                    {0, 0, 0, 0, 0},
                    {0, 1, 0, 1, 0},
                    {2, 7, 0, 7, 2},
                    {0, 10, 0, 10, 0},
                    {0, 0, 5, 0, 0}
            },
            {
                    {0, 0, 2, 0, 0},
                    {0, 1, 7, 10, 0},
                    {0, 0, 0, 0, 5},
                    {0, 1, 7, 10, 0},
                    {0, 0, 2, 0, 0}
            },
            {
                    {0, 0, 5, 0, 0},
                    {0, 10, 0, 10, 0},
                    {2, 7, 0, 7, 2},
                    {0, 1, 0, 1, 0},
                    {0, 0, 0, 0, 0}
            }
    };
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        n = Integer.parseInt(br.readLine());

        map = new int[n+2][n+2];
        for(int i=1;i<=n;i++){
            StringTokenizer st = new StringTokenizer(br.readLine());
            for(int j=1;j<=n;j++){
                map[i][j] = Integer.parseInt(st.nextToken());
            }
        }//map정보받기
        sx = (n+1)/2; sy = (n+1)/2;

        int orderCnt = 0;
        int orderMax = 1;
        int order = 0;
        int cnt = 0;
        while(true){

            if(sx == 1 && sy == 1){
                System.out.println(total);
                return;
            }

            int cx = sx + dx[cnt];
            int cy = sy + dy[cnt];
            int cValue = map[cx][cy];

            for(int i=0;i<5;i++){
                for(int j=0;j<5;j++){
                    int nx = cx-2+i ;
                    int ny = cy-2+j;

                    if(isBorder(nx, ny)){
                        if(change[cnt][i][j]!=0){
                            total += (change[cnt][i][j]*cValue)/100;
                            map[cx][cy]-=(change[cnt][i][j]*cValue)/100;
                        }
                        continue;
                    }else{
                        map[nx][ny]+=(change[cnt][i][j]*cValue)/100;
                        map[cx][cy]-=(change[cnt][i][j]*cValue)/100;
                    }
                }
            }

            if(isBorder(cx+dx[cnt], cy+dy[cnt])) total += map[cx][cy];
            else map[cx+dx[cnt]][cy+dy[cnt]]+= map[cx][cy];

            map[cx][cy] = 0;
            sx = cx; sy = cy;

            order++;
            if(order==orderMax){
                order = 0;
                cnt = (cnt+1)%4;
                if(orderCnt%2!=0){
                    orderMax++;
                }
                orderCnt++;
            }
        }
    }

    private static boolean isBorder(int x, int y){
        return (x<=0 || y<=0 || x>n || y>n);
    }
}