#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

void dfs(vector<bool> &has, ll now_state) {
    has[now_state] = true;
    for (ll i = 0; i < 25; i++) {
        if (!((now_state >> i) & 1)) {
            continue;
        }
        ll dx = i % 5;
        ll dy = i / 5;
        if (dx > 0) {
            if (!((now_state >> (i - 1)) & 1)) {
                if (has[now_state + (1 << (i - 1))]) {
                    continue;
                }
                dfs(has, now_state + (1 << (i - 1)));
            }
        }
        if (dx < 4) {
            if (!((now_state >> (i + 1)) & 1)) {
                if (has[now_state + (1 << (i + 1))]) {
                    continue;
                }
                dfs(has, now_state + (1 << (i + 1)));
            }
        }
        if (dy > 0) {
            if (!((now_state >> (i - 5)) & 1)) {
                if (has[now_state + (1 << (i - 5))]) {
                    continue;
                }
                dfs(has, now_state + (1 << (i - 5)));
            }
        }
        if (dy < 4) {
            if (!((now_state >> (i + 5)) & 1)) {
                if (has[now_state + (1 << (i + 5))]) {
                    continue;
                }
                dfs(has, now_state + (1 << (i + 5)));
            }
        }
    }
}

int main() {
    vector<vector<ll>> C(5, vector<ll>(5));
    for (ll i = 0; i < 5; i++) {
        for (ll j = 0; j < 5; j++) {
            cin >> C[i][j];
        }
    }

    // DFS で、連結になっているものを管理する
    vector<bool> has(1 << 25, false);
    for (ll i = 0; i < 25; i++) {
        if (has[1 << i]) {
            continue;
        }
        dfs(has, 1 << i);
    }
    ll valid = 0;
    for (ll i = 0; i < (1 << 25); i++) {
        if (has[i]) {
            valid++;
        }
    }
    ll INF = 100000000000023;
    ll ans = INF;
    for (ll i = 0; i < (1 << 25); i++) {
        if (has[i] && has[(1 << 25) - 1 - i]) {
            ll cnt_a = 0;
            ll cnt_b = 0;
            for (ll j = 0; j < 25; j++) {
                if ((i >> j) & 1) {
                    cnt_a += C[j / 5][j % 5];
                } else {
                    cnt_b += C[j / 5][j % 5];
                }
            }
            ans = min(ans, abs(cnt_a - cnt_b));
        }
    }
    cout << ans << endl;
}