#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;
}

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];
        }
    }
    ll ans=abs(sum-g[0][0]*2);
    vector<bool> seen(1<<25);
    seen[1]=1;
    auto dfs=[&](auto &self,ll bit,ll now,ll cum) -> void{
        ll x=now/5,y=now%5;
        rep(k,4){
            ll nx=x+dx[k],ny=y+dy[k];
            if(nx<0||ny<0||nx>=n||ny>=n)continue;
            if(bit>>(nx*n+ny)&1)continue;
            ll to=bit|(1<<(nx*n+ny));
            if(seen[to])continue;
            seen[to]=1;
            cum+=g[nx][ny];
            chmin(ans,abs(sum-cum*2));
            self(self,to,nx*n+ny,cum);
            cum-=g[nx][y];
        }
    };
    dfs(dfs,1,0,g[0][0]);
    cout << ans << endl;
}