#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using tiii = tuple<int,int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const ll DIV =1e9+7;
//const double PI = M_PI;
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}
#define chmax(a,b) a=max(a,b)

/*Coding Space*/

bool ttable[5][5] = {};
bool tttable[5][5] = {};
ll check(ll num){
  rep(i,5)rep(j,5) ttable[i][j] = tttable[i][j] = (((num >> (i + j*5))) & 1);
  if(ttable[0][0] == 0)  return 0;
  queue<tii> q;
  map<tii,int> used;
  q.push(tii{0,0});
  while(!q.empty()){
    if(used.count(q.front())){q.pop(); continue;}
    int x,y; tie(x,y) = q.front(); q.pop();
    if(x > 5 || y > 5) continue;
    if(ttable[x][y] == 0)  continue;
    used[tii{x,y}] = 1;
    q.push(tii{x,y+1});
    q.push(tii{x+1,y});
    ttable[x][y] = 0;
  }
  //cerr << '!'<<endl;
  //rep(i,4){rep(j,4)cerr<<(ttable[i][j] == 1);  cerr << endl;}
  rep(i,5)rep(j,5)if(ttable[i][j] == 1) return 0;
  return 1;
}

ll table[5][5] = {};
ll score(int num){
  ll ret = 0;
  rep(i,5)rep(j,5)if(tttable[i][j]) ret += table[i][j];
  return ret;
}

int main(){
  ll sum = 0;
  rep(i,5)rep(j,5) cin >> table[i][j],sum += table[i][j];
  ll ans = LLINF;
  rep(i,1024*1024){
    if(check(i)){
      ans = min(ans, abs(sum - 2*score(i)));
    }
  }
  cout << ans << endl;
}