#include <values.h>
#include <stdio.h>
#define M 30		//Max vertices

int used[M],min[M],gens[M]; //in span?;nearest vertex in span;data

int bits(int x,int y){
 int b=0,i,c=gens[x]^gens[y];
 for (i=0; i<30; i++) b+=c%2,c/=2;
 return b;
} //bits

int main(){
 int j,i,b,N,mutat=0;	//N=vertices; \# mutations
 int minI,minV=MAXINT;		//nearest vertex index; min edge val
 used[0]=1;		//root of tree
 scanf("%d",&N);for (i=0;i<N;i++) scanf("%d",&gens[i]); 	//input
 
 for (j=0;j<N-1;j++) { 		//spanning tree has n-1 edges
  for (i=0,minV=MAXINT; i<N; i++) 	//nearest edge
    if (!used[i]) b=bits(i,min[i]), minV= b<minV?minI=i,b:minV;
    
  used[minI]=1; mutat+=bits(minI,min[minI]);  //add it to span
  printf("%d->%d;",gens[min[minI]],gens[minI]); 
  
  for (i=0;i<N;i++)			//update nearest vertices
    if (!used[i]) if (bits(i,minI)<bits(i,min[i])) min[i]=minI;
  } //for j
  
 printf("\nCelkove %d mutaci\n",mutat);
} //main