#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i=a;i<(b);++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define int long long

int getNum(vector<string> nugm){
    int res = 1;
    for(int i=0; i<nugm.size()-1; i++){
        for(int j=0; j<nugm[i].size(); j++){
            if(nugm[i][j]=='#'){
                if(j+1<sz(nugm[i])&&nugm[i+1][j+1]=='#'){
                    res*=2;
                }
                else{
                    res*=2;
                    res+=1;
                }
            }
        }
    }
    return  res;
}

int32_t main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    

    int n;cin>>n;
    vector<string> arr(n);
    rep(i,0,n){
        cin>>arr[i];
    }

    int m;cin>>m;
    vector<string> brr(m);
    rep(i,0,m)
        cin>>brr[i];

    int num1 = getNum(arr);
    int num2 = getNum(brr);

    int res = num1+num2;

    int minm = 0;
    int maxm = 0;
    int cur = 0;
    vector<int> resarr;
    while(res!=0){//bug?
        resarr.push_back(cur);
        minm = min(cur, minm);
        maxm = max(cur, maxm);
        if(res&1){
            cur++;
        }
        else{
            cur--;
        }

        res/=2;        
    }
    cout<<sz(resarr)<<'\n';
    for(int i = sz(resarr)-1; i>=0; i--){
        rep(j, minm, maxm+1){
            if(resarr[i]==j)
                cout<<'#';
            else
                cout<<'.';
        }
        cout<<'\n';
    }
}