Let's implement an algorithm that tells us how many trees there are and what trees there are in a random graph.

The maximum number of graph nodes is $50,$ and the input is as a file $($the number of nodes in the first line and the adjacency matrix data in the next line, but all data are separated by a space. In other words, it does not go to the next line to enter.$)$

You have to be able to receive it$.$

The final output is

If you don't have a tree, you have to print it out. If you don't have one, you have to let me know what trees are there.

$($Note: Graphs with only one node are also trees.$)$

Make this by $"$C$"$

$-------------------------------------------------$