#include<bits/stdc++.h>
#define ll long long
#define el '\n'
#define all(a) a.begin(),a.end()

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
template<typename T>

using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N=1e5+5,mod=1e9+7;


   vector<int>v[4];
void solve(ll t)
{
   string s;
   cin>>s;
   for(int i=0;i<4;i++){
       int num=s[i]-'0';
       int cnt=3;
       while(cnt!=-1){
           v[cnt].push_back(num%2);
           num/=2;
           cnt--;
       }
   }
//   cout<<'l';
//  cout<<v[3][0];
   for(int i=0;i<4;i++){
       for(int j=0;j<v[i].size();j++){
           if(v[i][j]==1)cout<<"*";
           else cout<<'.';
           if(j==1)cout<<' ';
       }
        if(i!=3)cout<<el;
   }
}

int main() {
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    ll t;
    //cin >> t;
    t = 1;
    for (ll i = 0 ; i < t ; i ++)
    {
        solve(t);
    }
}