read N: n32;

for u upto N {
    for v upto N {
        read A[u][v]: n32;
    }
}

call find_cycle(N, A) -> L: n32;
write L;

for i upto L {
    call get_cycle_node(i) -> u: n32;
    write u;
}