/*
 It might be a heck of a lot easier to just keep everything in memory until
 we are done...

list<string>
//string= "sequence+"+'#'+"fsa pairs";

Also keep unsigned longs instead of doing the whole gmp thing.

*/


int edges[1000][1000];
int verts;





void clearEdges()
{
  int i;
  for(i=0;i<verts*verts;i++)
    edges[i][0]=0;
}


int notIso(int depth)
{
  //use binary search on masterfile to search for sequence
  //look for files that have same vertex and edge number
  //do isomorphism test
  /*
   Leave zero alone
   Try all permutations 1....k
  */

}


int writeToFile(depth)
{
  FILE* newFile;
  FILE* oldFile;
  FILE* masterFile;


  /*
  FILENAME= nodes.edges.number
  File stores:
  The first 30 terms of the sequence.
  -1
  The FSM in edge format
  //This is tested for graph isomormphism to disallow multiple entries
  -1
  hyperlinks to files with the same sequence
  
  Updates MasterFile:
  A list of all files sorted in "alphabetical" order of their sequences.
*/



}



int treeCheck()
{
  int reachability[verts];
  int i,j,k;
  for(i=0;i<verts;i++)
    reachability[i]=0;
  reachability[0]=1;
  for(i=0;i<depth;i++)
    {
      for(j=0;j<verts;j++)
	{
	  for(k=0;k<verts;k++)
	    {
	      if(edges[depth][(j*verts) +k])
		{
		  if(reachability[j])
		    reachability[k]=1;
		}
	    }
	}
    }
  for(i=0;i<verts;i++)
    {
      if(!reachability[i])
	return 0;
    }
  return 1;
}


//isLegal tells me if the previous level was a full tree on the space
//if so I can go straight to checking isomorphisms.
dfsNextLevel(int depth,int isLegal)
{
  int i;
  for(i=0;i<verts*verts;i++)
    edges[i][depth]=edges[i][depth-1];
  //lets do legal check...
  if(!isLegal)
    {
      //check to see if my edges have a valid tree.
      if(treeCheck(depth))
	isLegal=1;
    }
  for(i=0;i<verts*verts;i++)
    {
      if(!edges[depth][i])
	{
	  edges[depth][i]=1;
	  if(isLegal)
	    {
	      if(notIso(depth))
		{
		  writeToFile(depth);
		  dfsNextLevel(depth+1,0);
		}
	    }
	  else
	    dfsNextLevel(depth+1,0);
	  edges[depth][i]=1;
	}
    }
}

int main()
{
  int i,j,k;

  scanf("%d",verts);
  clearEdges(0);
  for(i=0;i<verts*verts;i++)
    {
      edges[i][0]=1;
      dfsNextLevel(1,0);
      edges[i][0]=0;
    }
}