#include<stdio.h>
#include<limits.h>
#define MAX 100
#define INF INT_MAX

void dijkstra(int graph[MAX][MAX],int n,int start)
{
    int dist[MAX];
    int visited[MAX]={0};
    for (int i=0;i<n;i++)
    {
        dist[i]=INF;
    }
    dist[start]=0;
    for(int count=0;count<n-1;count++)
    {
        int min=INF,u=-1;
        for(int v=0;v<n;v++)
        {
            if(!visited[v]&&dist[v]<=min)
            {
                min=dist[v];
                u=v;
            }
        }
        if(u==-1)break;
        visited[u]=1;
        for(int v=0;v<n;v++)
        {
            if(!visited[v]&&graph[u][v]!=0&&dist[u]!=INF&&dist[u]+graph[u][v]<dist[v])
            {
                dist[v]=dist[u]+graph[u][v];
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        if(dist[i]==INF)
        printf("INF");
        else
        printf("%d",dist[i]);
    }
        return("\n");
}
    int main()
    int n;