import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

int N;
long[][] A;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new long[][](N, N);
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        if (u != v) {
          A[u][v] = readLong();
        }
      }
      
      auto sumL = new long[][N];
      auto sumR = new long[][N];
      foreach (u; 0 .. N) {
        sumL[u] = new long[u + 1];
        sumR[u] = new long[u + 1];
        foreach (v; 0 .. u) {
          sumL[u][v + 1] = sumL[u][v] + A[u][v];
          sumR[u][v + 1] = sumR[u][v] + A[v][u];
        }
      }
      
      auto dp = new long[][](1, 1);
      dp[0][0] = 0;
      foreach (u; 1 .. N) {
        auto dpNext = new long[][](u + 1, u + 1);
        foreach (a; 0 .. u + 1) foreach (b; a .. u + 1) {
          dpNext[a][b] = INF;
        }
        foreach (a; 0 .. u) foreach (b; a .. u) {
          // -0
          chmin(dpNext[a][b], dp[a][b] + sumL[u][a] + (sumR[u][u] - sumR[u][b]));
          // -1
          chmin(dpNext[b][u], dp[a][b] + sumL[u][b]);
        }
        dp = dpNext;
      }
      long ans = INF;
      foreach (a; 0 .. N) foreach (b; a .. N) {
        chmin(ans, dp[a][b]);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
