#include "stdio.h"
#define M 105
#define MAX 100005
int map[M][M];
void prim (int n)
{
cost[M],flag[M],i,j,k,min,sum;
< n;i ++)
cost[i] = map[0][i];
flag[i] = 0;
1;
0;
< n;i ++)
min = MAX;
for (j = 1;j < n;j ++)
if (flag[j] == 0&&cost[j]
< min)
{
min
k = j;
}
flag[k] = 1;
sum += cost[k];
for (j = 1;j < n;j ++)
if (cost[j] > map[k][j])
cost[j] = map[k][j];
("%d\n",sum);
}
int main ()
{
n,i,j;
("%d",&n)!= EOF)
for (i = 0;i < n;i ++)
for (j = 0;j < n;j++)
{
scanf ("%d",&map[i][j]);
if (i == j)