#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}


struct UnionFind{
  Int n,num;
  vector<Int> r,p;
  UnionFind(){}
  UnionFind(Int sz):n(sz),num(sz),r(sz,1),p(sz,0){iota(p.begin(),p.end(),0);}
  Int find(Int x){
    return (x==p[x]?x:p[x]=find(p[x]));
  }
  bool same(Int x,Int y){
    return find(x)==find(y);
  }
  void unite(Int x,Int y){
    x=find(x);y=find(y);
    if(x==y) return;
    if(r[x]<r[y]) swap(x,y);
    r[x]+=r[y];
    p[y]=x;
    num--;
  }
  Int size(Int x){
    return r[find(x)];
  }
  Int count() const{
    return num;
  }
};

//INSERT ABOVE HERE
signed main(){
  const Int n=5;
  Int cs[n][n];
  for(Int i=0;i<n;i++)
    for(Int j=0;j<n;j++)
      cin>>cs[i][j];

  Int s=(1<<(n*n-1));
  Int ds[n][n]={};

  Int sum=0;
  for(Int i=0;i<n;i++)
    for(Int j=0;j<n;j++)
      sum+=cs[i][j];

  Int ans=sum;
  for(Int i=0;i<n;i++)
    for(Int j=0;j<n;j++)
      chmin(ans,abs(sum-cs[i][j]*2));

  auto idx=[&](Int y,Int x){return y*n+x;};
  vector<Int> dp(s,0),vl(s,0);
  for(Int i=0;i+1<n*n;i++) vl[1<<i]=cs[i/n][i%n];
  for(Int b=0;b<s;b++){
    if(vl[b]) dp[b]=vl[b];
    else dp[b]=dp[b^(b&-b)]+vl[b&-b];

    Int res=dp[b]+cs[n-1][n-1];
    if(ans<=abs(sum-res*2)) continue;

    for(Int i=0;i<n;i++)
      for(Int j=0;j<n;j++)
        ds[i][j]=(b>>idx(i,j))&1;

    ds[n-1][n-1]=1;
    UnionFind uf(n*n);
    for(Int i=0;i<n;i++){
      for(Int j=0;j<n;j++){
        if(i+1<n&&ds[i][j]==ds[i+1][j]) uf.unite(idx(i,j),idx(i+1,j));
        if(j+1<n&&ds[i][j]==ds[i][j+1]) uf.unite(idx(i,j),idx(i,j+1));
      }
    }
    if(uf.count()==2) ans=abs(sum-res*2);
  }
  cout<<ans<<endl;
  return 0;
}