Some text (not containing zeros) could (but do not have to) be placed here. There is 
the adjacency matrix of an arbitrary graph. In the output file, you will find all 
maximal cliques of this graph. Note, the vertices are labelled by numbers (in natural order).


0 1 1 1	1 0 1 0	1 0	
1 0 1 0	1 1 1 1	0 0	
1 1 0 1	1 0 1 0	0 1	
1 0 1 0	0 1 0 1	0 0	
1 1 1 0	0 1 1 0	1 0	
0 1 0 1	1 0 0 0	0 1	
1 1 1 0	1 0 0 1	0 1	
0 1 0 1	0 0 1 0	1 0	
1 0 0 0	1 0 0 1	0 1	
0 0 1 0	0 1 1 0	1 0	
