#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<ld, ld> pdd;
#define vec vector
#define For(i, a, n) for(ll i=(ll)a;i<n;i++)
#define all(x) begin(x), end(x)
#define sz(x) (ll)size(x)

template<class A, class B>
pair<A,B>operator+(const pair<A, B>&a, const pair<A,B>&b){
    return {a.first + b.first, a.second + b.second};
}
template<class A, class B>
ostream&operator<<(ostream&os, const pair<A, B>&c){
    return os<<"("<<c.first<<", "<<c.second<<")";
}
template<class A, class B, class C>
basic_ostream<A,B>&operator<<(basic_ostream<A, B>&os, const C&c){
    for(auto itr=begin(c);itr!=end(c);++itr){
        os<<(itr==begin(c)?"":" ")<<*itr;
    }
    return os;
}
template<typename...Args>
void dbg(Args&&...args){
    ((cerr<<args<<" |"),...);cerr<<endl;
}


void solve(){

    ll n;

    cin >> n;
    ll a = 1;
    string frow;
    cin >> frow;
    ll cols = frow.size();
    ll pos;
    For(i,0,cols){
        if(frow[i] == '#'){
            pos = i;
            break;
        }
    }
    For(i,1,n){
        string row;
        cin >> row;
        a *= 2;
        if(pos > 0 && row[pos-1]=='#'){
            a++;
            pos--;
        }else{
            pos++;
        }
    }

    cin >> n;
    ll b = 1;
    cin >> frow;
    cols = frow.size();
    For(i,0,cols){
        if(frow[i] == '#'){
            pos = i;
            break;
        }
    }
    For(i,1,n){
        string row;
        cin >> row;
        b *= 2;
        if(pos > 0 && row[pos-1]=='#'){
            b++;
            pos--;
        }else{
            pos++;
        }
    }

    ll c = a+b;

    vector<bool> rbin;
    pos = 0;
    ll minimal = 0;
    ll maximal = 0;
    while(c > 1){
        bool right = c%2;
        rbin.push_back(right);
        if(right){
            pos++;
        }else{
            pos--;
        }
        minimal = min(minimal,pos);
        maximal = max(maximal,pos);
        c/=2;
    }
    cout << rbin.size()+1 << "\n";
    For(row,0,rbin.size()+1){
        For(i,0,maximal-minimal+1){
            if(i == pos-minimal){
                cout << '#';
            }else{
                cout << '.';
            }
        }
        cout << "\n";
        if(row < rbin.size() && rbin[rbin.size()-1-row]){
            pos--;
        }else{
            pos++;
        }
    }
    
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t = 1;
    while(t--)solve();
    return 0;
}