#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define nl "\n"
#define sz(x) int(x.size())
#define NumOfDigit(w) log10(w) + 1
#define fill(arr, val)  memset(arr, val , sizeof(arr))
#define PI 3.141592654
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fi first
#define se second
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define fixed(n) fixed << setprecision(n)
//#define MOD  1e9 + 7


void IO(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
}
void files(){
    //freopen("filename.in" , "r" ,stdin);
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);  freopen("output.txt", "w", stdout);
            #endif
}

void solve(){

int n ;
cin >> n ;

vector < vector < vector < int > > > arr(n, vector<vector< int  > >(5, vector< int >(5)));

for(int i=0 ; i < n ; i++){

    for(int j =0 ; j < 5 ; j++){
          int x ;
        cin >> x;
        bitset < 32 > bit(x);
       // cout << bit ;
       if( x == 32 ){
           arr[i][j][0]='*' ;
           for(int q = 1 ; q < 5 ;q++) arr[i][j][q]=' ';
       }
       else {
           int id=0;
           for(int e= 0 ; e  < 5  ; e++){
              // cout << bit[e];
               arr[i][j][e]= bit[e];
              // if( bit[e]=='1') arr[i][j][id++]='*';
              // else arr[i][j][id++]=' ';
           }
           reverse(all(arr[i][j]));
       }

      // cout(arr[i][j]);
      // cout << nl;
    }
}

for(int i=0 ; i < 5 ; i++){
    for(int j = 0 ; j < n ; j++){

       for(auto& x : arr[j][i]){
           if(x==1) cout<<'*';
           else cout <<" ";
       }
        cout << ' ';
    }
    cout << nl;
}




}

int main(){
                 IO();       //  files();

    int testCase=1;  // one test case
    //cin >> testCase ;
 while(testCase--)
        solve();  // my code

    return 0;
}