#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

bool tonari[25][25];
void init() {
	rep(i, 5) {
		rep(j, 5) {
			rep(k, 4) {
				int nx = i + dx[k];
				int ny = j + dy[k];
				if (nx < 0 || ny < 0 || nx >= 5 || ny >= 5)continue;
				tonari[i * 5 + j][nx * 5 + ny] = true;
			}
		}
	}
}
ll ans = INF;
ll allsum = 0;
ll c[5][5];
ll v[25];
bool used[1 << 25];
bool vis[25];

bool valid(int s) {
	vector<int> v;
	rep(j, 25) {
		vis[j] = false;
		if (s&(1 << j))continue;
		v.push_back(j);
	}
	if (v.empty())return true;
	queue<int> q; q.push(v[0]);
	vis[v[0]] = true;
	while (!q.empty()) {
		int cur = q.front(); q.pop();
		rep(j, v.size()) {
			if (vis[v[j]])continue;
			if (tonari[cur][v[j]]) {
				q.push(v[j]); vis[v[j]] = true;
			}
		}
	}
	rep(j, v.size())if (!vis[v[j]])return false;
	return true;
}

void dfs(int s) {
	if (used[s])return;
	used[s] = true;
	if (!valid(s))return;
	ll ss = 0;
	rep(i, 25) {
		if (s&(1 << i)) {
			ss += v[i];
		}
	}
	ans = min(ans, abs(allsum - 2 * ss));
	if (2 * ss >= allsum)return;
	rep(i, 5) {
		rep(j, 5) {
			int x = i * 5 + j;
			if (s&(1 << x))continue;
			bool f = false;
			rep(k, 4) {
				int nx = i + dx[k];
				int ny = j + dy[k];
				if (nx < 0 || ny < 0 || nx >= 5 || ny >= 5)continue;
				int nid = nx * 5 + ny;
				if (s&(1 << nid)) {
					f = true; break;
				}
			}
			if (f) {
				dfs(s ^ (1 << x));
			}
		}
	}
}
void solve() {
	rep(i, 5) {
		rep(j, 5) {
			cin >> c[i][j];
			allsum += c[i][j];
			v[i * 5 + j] = c[i][j];
		}
	}
	dfs(1);
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	init();
	solve();
	//cout << "finish" << endl;
	//stop
	return 0;
}