#include<stdio.h>
#define max 10000;
int arcs[100][100]; //matrix
int d[100]; //shortest distance
int fina[100]; //vertex judge,1 stand for yes(in s)
int n; //edge
int v0 = 0; // vertex
void dijkstra()
{
int v, k;
int min;
for(v = v0;v < n;v++)
{
fina[v] = 0;
d[v] = arcs[v0][v];
}
d[v0] = 0;
fina[v0] = 1;
for(int i = 1;i < n;i++)
{
min = max;
for(k = 0;k < n;k++)
{
if(fina[k] == 0) //k点在v-s中,尚未进行处理
{
if(d[k] < min)
{
v = k;
min = d[k];
}
}
}
fina[v] = 1;
for(k = 0;k < n;k++)
{
if(fina[k] == 0 && (min+arcs[v][k] < d[k]))
{
d[k] = min + arcs[v][k];
}
}
}
}
int main()
{
scanf("%d",&n);
for(int i = 0;i < n;i++)
{
for(int j = 0;j < n;j++)
{
scanf("%d",&arcs[i][j]);
}
}
dijkstra();
for(int i = 0;i < n;i++)
{
printf("%d\n",d[i]);
}
return 0;
}