#include <bits/stdc++.h>
using namespace std;
bool flag[2000 + 10];
int a[2000 + 10][2000 + 10];
long long Dist[2000 + 10];
int n, Minv = 0x7FFFFFFF;
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    for (int j = i + 1; j <= n; j++) {
      int x;
      scanf("%d", &x);
      a[i][j] = a[j][i] = x;
      Minv = min(Minv, x);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i != j) a[i][j] -= Minv;
    }
  }
  for (int i = 1; i <= n; i++) {
    Dist[i] = 1e16;
    for (int j = 1; j <= n; j++) {
      if (i != j) Dist[i] = min(Dist[i], 2ll * a[i][j]);
    }
  }
  Dist[0] = 1e16;
  for (int i = 1; i <= n; i++) {
    int k = 0;
    for (int j = 1; j <= n; j++) {
      if (flag[j]) continue;
      if (Dist[j] < Dist[k]) k = j;
    }
    flag[k] = 1;
    for (int j = 1; j <= n; j++) Dist[j] = min(Dist[j], Dist[k] + a[k][j]);
  }
  for (int i = 1; i <= n; i++)
    cout << Dist[i] + (long long)(n - 1) * Minv << endl;
  return 0;
}
