#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)

// ---- ----

class UnionFind {
private:
	int n, s;
	vector<int> t;
	vector<vector<int>> v;
public:
	UnionFind(int arg_n = 0) { init(arg_n); }
	void init(int arg_n) {
		n = s = arg_n;
		t.clear();
		v.clear();
		inc(i, n) { t.PB(i); v.EB(1, i); }
	}
	int get_n() { return n; }
	int size() { return s; }
	int id(int x) { return t.at(x); }
	const vector<vector<int>> & get_v() { return v; }
	bool unite(int x, int y) {
		x = id(x);
		y = id(y);
		if(x == y) { return false; }
		if(v[x].size() < v[y].size()) { swap(x, y); }
		for(auto & e: v[y]) { v[x].PB(e); t[e] = x; }
		v[y].clear();
		s--;
		return true;
	}
	bool same(int x, int y) { return (id(x) == id(y)); }
	const vector<int> & operator[](int x) { return v[id(x)]; }
	friend ostream & operator<<(ostream & os, const UnionFind & uf) {
		inc(i, uf.n) { os << i << ": "; for(auto & e: uf.v[i]) { os << e << " "; } os << "\n"; }
		return os;
	}
};

// ---- ----

LL c[5][5], sum, ma, b[6][6];

vector<pair<int, int>> v = {
	{ 0, 0 }, { 0, 1 }, { 0, 2 }, { 0, 3 },
	{ 0, 4 }, { 1, 4 }, { 2, 4 }, { 3, 4 },
	{ 4, 4 }, { 4, 3 }, { 4, 2 }, { 4, 1 },
	{ 4, 0 }, { 3, 0 }, { 2, 0 }, { 1, 0 }
};

int id(int i, int j) { return 5 * i + j; }

int main() {
	inc(i, 5) {
	inc(j, 5) {
		cin >> c[i][j];
		sum += c[i][j];
	}
	}
	
	inc(i, 6) {
	inc(j, 6) {
		b[i][j] = -1;
	}
	}
	
	inc(B, 1 << 9) {
	incII(zc, 0, 16) {
	inc(zp, 16) {
		inc(i, 5) {
		inc(j, 5) {
			b[i][j] = 0;
		}
		}
		
		inc(i, 9) { b[i / 3 + 1][i % 3 + 1] = bit(B, i); }
		inc(zi, zc) { auto p = v[(zp + zi) % 16]; b[p.FI][p.SE] = 1; }
		
		UnionFind uf(25);
		inc(i, 5) {
		inc(j, 5) {
			if(b[i][j] == b[i + 1][j]) { uf.unite(id(i, j), id(i + 1, j)); }
			if(b[i][j] == b[i][j + 1]) { uf.unite(id(i, j), id(i, j + 1)); }
		}
		}
		
		if(SI(uf) == 2) {
			LL w = 0;
			inc(i, 5) {
			inc(j, 5) {
				w += b[i][j] * c[i][j];
			}
			}
			if(w <= sum / 2) { setmax(ma, w); }
		}
	}
	}
	}
	
	cout << sum - 2 * ma << endl;
	
	return 0;	
}