#include <algorithm>
#include <iostream>
#include <string>
#include <set>

#define maxn 5

using namespace std;

int n;
string v[1<<maxn], b[maxn];
set< string > s;

void load() {
   cin >> n;
   for( int i = 0; i < (1<<n); ++i ) cin >> v[i];
   sort( v, v+(1<<n) );
}

string zbroji( const string &a, const string &b ) {
   string ret = a;
   for( int i = 0; i < a.size(); ++i )
      if( b[i] == '1' ) ret[i] = a[i] == '1'? '0': '1';
   return ret;
}

void rek2( int i, string val ) {
   if( i == n ) {
      s.insert( val );
      return;
   }

   rek2( i+1, val );
   rek2( i+1, zbroji( val, b[i] ) );
}

void check() {
   s.clear();
   rek2( 0, string( v[0].size(), '0' ) );

   if( s.size() != (1<<n) ) return;

   int i = 0;
   for( set< string >::iterator it = s.begin(); it != s.end(); ++it )
      if( *it != v[i++] ) return;

   throw 0;
}

void rek( int i, int k ) {
   if( k == n ) check();
   else {
      if( i == (1<<n) ) return;

      rek( i+1, k );

      b[k] = v[i];
      rek( i+1, k+1 );
   }
}

int main(void) {
   load();

   try { rek( 0, 0 ); }
   catch( int e ) {

      for( int i = 0; i < n; ++i ) cout << b[i] << endl;

   }
   return 0;
}