/**
 *    author:  tourist
 *    created: 21.07.2019 15:23:17       
**/
#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

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

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> a(n, vector<int>(n));
  long long total = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i != j) {
        cin >> a[i][j];
        total += a[i][j];
      }
    }
  }
  vector<vector<long long>> sumI(n + 1, vector<long long>(n + 1));
  for (int j = 0; j < n; j++) {
    sumI[0][j] = 0;
    for (int i = 0; i < n; i++) {
      sumI[i + 1][j] = sumI[i][j] + a[i][j];
    }
  }
  vector<vector<long long>> sumJ(n + 1, vector<long long>(n + 1));
  for (int i = 0; i < n; i++) {
    sumJ[i][0] = 0;
    for (int j = 0; j < n; j++) {
      sumJ[i][j + 1] = sumJ[i][j] + a[i][j];
    }
  }
  vector<vector<long long>> dp(n + 1, vector<long long>(n + 1, -1));
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i; j <= n; j++) {
      if (dp[i][j] == -1) {
        continue;
      }
      long long ft = dp[i][j];
      for (int k = j; k < n; k++) {
        ft += sumI[j][k];
        ft += sumJ[k][k] - sumJ[k][i];
        dp[j][k + 1] = max(dp[j][k + 1], ft);
      }
    }
  }
  long long ans = -1;
  for (int i = 0; i < n; i++) {
    ans = max(ans, dp[i][n]);
  }
  cout << total - ans << '\n';
  return 0;
}


Measured memory_bytes: 7168