#include <bits/stdc++.h>
using namespace std;
const int N = 2100;
const int INF = 2000000000;
int n, mn, dis[N], bz[N], e[N][N];
int read() {
  int ret = 0, sig = 1;
  char c;
  while (c = getchar(), (c < '0' || c > '9') && c != '-')
    ;
  if (c == '-')
    sig = -1;
  else
    ret = c - '0';
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + c - '0';
  return ret * sig;
}
int main() {
  n = read();
  mn = INF;
  for (int i = 1; i <= n - 1; i++)
    for (int j = i + 1; j <= n; j++) {
      e[i][j] = e[j][i] = read();
      mn = min(mn, e[i][j]);
    }
  for (int i = 0; i <= n; i++) dis[i] = INF;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (i != j) {
        e[i][j] -= mn;
        dis[i] = min(dis[i], e[i][j] * 2);
      }
  for (int i = 1; i <= n; i++) {
    int pos = 0;
    for (int j = 1; j <= n; j++)
      if (dis[j] < dis[pos] && !bz[j]) pos = j;
    bz[pos] = 1;
    for (int j = 1; j <= n; j++) dis[j] = min(dis[j], dis[pos] + e[pos][j]);
  }
  for (int i = 1; i <= n; i++) printf("%I64d\n", 1LL * mn * (n - 1) + dis[i]);
  return 0;
}
