/**
 *  author: ivanzuki   
 *  created: Thu May 27 2021
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  const int n = 5;
  vector<vector<int>> c(n, vector<int>(n));
  long long total = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> c[i][j];
      total += c[i][j];
    }
  }
  long long ans = (long long) 1e18;
  const vector<int> dx = {-1, 0, 1, 0};
  const vector<int> dy = {0, -1, 0, 1};
  vector<int> was(1 << (n * n));
  function<bool(int, int, int)> On = [&](int mask, int x, int y) {
    return (mask >> (x * n + y)) & 1;
  };
  function<void(int, long long)> DFS = [&](int mask, long long sum) {
    was[mask] = 1;
    ans = min(ans, abs(sum - (total - sum)));
    for (int x = 0; x < n; x++) {
      for (int y = 0; y < n; y++) {
        if (On(mask, x, y)) {
          continue;
        }
        for (int k = 0; k < 4; k++) {
          int xk = x + dx[k];
          int yk = y + dy[k];
          if (0 <= xk && xk < n && 0 <= yk && yk < n && On(mask, xk, yk) && !was[mask | (1 << (x * n + y))]) {
            DFS(mask | (1 << (x * n + y)), sum + c[x][y]);
          }
        }
      }
    }
  };
  DFS(1, c[0][0]);
  cout << ans << '\n';
  return 0;
}