#include <bits/stdc++.h>

#define int long long
#define vec vector
#define forn(i, n) for(int i = 0;i<n;i++)
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define read(a) forn(i, (a).size()) cin>>(a)[i]
#define write(a) forn(i, (a).size()) cout<<(a)[i] << " "; cout << "\n";

using namespace std;

int mod = 1e9+7;

int decode(vec<string> s){
    int n = 1;
    int pos = -1;
    for(int i = 0;i<s[0].size();i++)
        if(s[0][i] == '#') {
            pos = i;
            break;
        }

    int i = 1;
    while(i < s.size()){
        if(pos + 1 < s[i].size() && s[i][pos+1] == '#'){
            n *= 2;
            pos++;
        }
        else{
            n *= 2;
            n++;
            pos--;
        }
        i++;
    }

    return n;
}

void solve(){
    int n;
    cin>>n;

    vec<string> c(n);
    for(int i = 0;i<n;i++)
        cin>>c[i];

    int m;
    cin>>m;
    vec<string> c1(m);
    for(int i = 0;i<m;i++)
        cin>>c1[i];

    int num1 = decode(c);
    int num2 = decode(c1);

    int ans = num1+num2;

    vec<string> a;

    int pos = 0;
    string s = "#";
    a.push_back(s);

    while(ans > 1){
        if(ans % 2 == 0){
            ans/=2;
            string s1 = a[a.size()-1];
            if(pos - 1 >= 0){
                s1[pos] = '.';
                pos--;
                s1[pos] = '#';
            }
            else{
                for(int i = 0;i<a.size();i++){
                    a[i] = "." + a[i];
                }
                s1 = a[a.size()-1];
                pos++;
                s1[pos] = '.';
                pos--;
                s1[pos] = '#';
            }
            a.push_back(s1);
        }
        else{
            ans--;
            ans/=2;
            string s1 = a[a.size()-1];
            if(pos + 1 < a.size()){
                s1[pos] = '.';
                pos++;
                s1[pos] = '#';
            }
            else{
                for(int i = 0;i<a.size();i++){
                    a[i] = a[i] + '.';
                }
                s1 = a[a.size()-1];
                s1[pos] = '.';
                pos++;
                s1[pos] = '#';
            }
            a.push_back(s1);
        }
    }

    reverse(all(a));

    cout << a.size() << "\n";

    for(auto i: a)
        cout << i << "\n";



}

signed main()
{
    int tt = 1;
    while(tt--){
        solve();
    }
}