#include<stdio.h>
int g[10][10],v[10],st[10],top=-1,n;
void dfs(int u)
{
v[u]=1;
for(int i=0;i<n;i++)
if(g[u][i] && !v[i])
dfs(i);
st[++top]=u;
}
int main()
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
for(int i=0;i<n;i++)
if(!v[i]) dfs(i);
while(top!=-1)
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KaW50IGdbMTBdWzEwXSx2WzEwXSxzdFsxMF0sdG9wPS0xLG47Cgp2b2lkIGRmcyhpbnQgdSkKewogICAgdlt1XT0xOwoKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspCiAgICAgICAgaWYoZ1t1XVtpXSAmJiAhdltpXSkKICAgICAgICAgICAgZGZzKGkpOwoKICAgIHN0WysrdG9wXT11Owp9CgppbnQgbWFpbigpCnsKICAgIHNjYW5mKCIlZCIsJm4pOwoKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspCiAgICAgICAgZm9yKGludCBqPTA7ajxuO2orKykKICAgICAgICAgICAgc2NhbmYoIiVkIiwmZ1tpXVtqXSk7CgogICAgZm9yKGludCBpPTA7aTxuO2krKykKICAgICAgICBpZighdltpXSkgZGZzKGkpOwoKICAgIHdoaWxlKHRvcCE9LTEpCiAgICAgICAgcHJpbnRmKCIlZCAiLHN0W3RvcC0tXSk7CgogICAgcmV0dXJuIDA7Cn0=