#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct UnionFind {
    vector<int> par;
    vector<int> edge;
    
    UnionFind(int n) : par(n, -1),edge(n, 0) {}

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};

int main(){
    ll n=5;
    vvl g(n,vl(n));
    ll sum=0;
    rep(i,n){
        rep(j,n){
            cin >> g[i][j];
            sum+=g[i][j];
        }
    }
    vector<bool> seen(1<<25);
    auto dfs=[&](auto &self,ll bit) -> void{
        rep(i,n*n){
            if(bit>>i&1)continue;
            ll to=bit|1<<i;
            if(seen[to])continue;
            bool ng=true;
            rep(k,4){
                ll nx=i/5+dx[k],ny=i%5+dy[k];
                if(nx<0||ny<0||nx>=n||ny>=n)continue;
                if(bit>>(nx*n+ny)&1)ng=false;
            }
            if(ng)continue;
            seen[to]=1;
            self(self,to);
        }
    };
    rep(i,n*n){
        seen[1<<i]=1;
        dfs(dfs,1<<i);
    }
    ll ans=INF;
    ll mask=1<<25;mask--;
    rep(bit,1<<25){
        if(seen[bit]&&seen[bit^mask]){
          ll ret=0;
          rep(i,n*n){
              if(bit>>i&1)ret+=g[i/5][i%5];
          }
          chmin(ans,abs(sum-ret*2));
        }
    }
    cout << ans << endl;
}