#include <bits/stdc++.h>
using namespace std;
bool endline = false;
template <class T>
istream& operator>>(istream& inp, vector<T>& v) {
  for (auto& it : v) inp >> it;
  return inp;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto& it : v) out << it << (endline ? "\n" : " ");
  return out;
}
template <class T, class U>
istream& operator>>(istream& inp, pair<T, U>& v) {
  inp >> v.first >> v.second;
  return inp;
}
template <class T, class U>
ostream& operator<<(ostream& out, pair<T, U>& v) {
  out << v.first << ' ' << v.second;
  return out;
}
void debug() { cout << endl; }
template <typename H, typename... T>
void debug(H a, T... b) {
  cout << a << ' ';
  debug(b...);
}
void FAST_IO(string filein = "", string fileout = "") {
  if (fopen(filein.c_str(), "r")) {
    freopen(filein.c_str(), "r", stdin);
    freopen(fileout.c_str(), "w", stdout);
  }
  cin.tie(0), cout.tie(0)->sync_with_stdio(0);
}
void Hollwo_Pelw();
signed main() {
  FAST_IO(".inp", ".out");
  int testcases = 1;
  for (int test = 1; test <= testcases; test++) {
    Hollwo_Pelw();
  }
  return 0;
}
const int allmod[3] = {(int)1e9 + 7, 998244353, (int)1e9 + 9};
const int mod = allmod[1];
const int MAXN = 1e5 + 5;
const int inf = 2e9;
const long long linf = 1e18;
long long n, a[2020][2020], dist[2020], vis[2020], p = linf;
void Hollwo_Pelw() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    a[i][i] = linf;
    for (long long j = i + 1, x; j <= n; j++) {
      cin >> x, p = min(p, a[i][j] = a[j][i] = x);
    }
  }
  for (long long i = 1; i <= n; i++) {
    dist[i] = linf;
    for (long long j = 1; j <= n; j++) {
      a[i][j] -= p;
      dist[i] = min(dist[i], a[i][j] << 1);
    }
  }
  for (long long i = 1; i <= n; i++) {
    long long k = 0;
    for (long long j = 1; j <= n; j++) {
      if (!vis[j] && (!k || dist[j] < dist[k])) k = j;
    }
    vis[k] = 1;
    for (long long j = 1; j <= n; j++) {
      if (dist[j] > dist[k] + a[k][j]) dist[j] = dist[k] + a[k][j];
    }
  }
  for (long long i = 1; i <= n; i++) cout << dist[i] + (n - 1) * p << "\n";
}
