#include <bits/stdc++.h>

// #define int long long
#define sz(a) (int)a.size()

using namespace std;

bool lanterns[50], a[50], save[50];
string odd_string, even_string;

void back(int cur, int mx, int cnt, int& res) {
    if (cur == mx) {
        if (cnt < res) {
            res = cnt;
            for (int i = 0; i < mx; i++) save[i] = a[i];
            res = cnt;
        }
        return;
    }

    a[cur] = 1;
    back(cur + 1, mx, cnt + 1, res);
    if (lanterns[cur] == 0) {
        bool flag = true;
        for (int d = 1; cur - 2 * d >= 0; d++) if (a[cur - d] == 0 && a[cur - 2 * d] == 0) {
            flag = false;
            break;
        }
        if (flag) {
            a[cur] = 0;
            back(cur + 1, mx, cnt, res);
        }
    }
}

int solve_odd(string s) {
    int n = sz(s), cur = 0, res = 50;
    odd_string.resize(n);
    for (int i = 0; i < n; i += 2) lanterns[cur++] = (s[i] == '#');
    back(0, cur, 0, res);
    for (int i = 0; i < n; i += 2) odd_string[i] = (save[i / 2] ? '#' : '.');
    for (int i = 1; i < n; i += 2) odd_string[i] = '#';
    return res + n / 2;
}

int solve_even(string s) {
    int n = sz(s), cur = 0, res = 50;
    even_string.resize(n);
    for (int i = 1; i < n; i += 2) lanterns[cur++] = (s[i] == '#');
    back(0, cur, 0, res);
    for (int i = 1; i < n; i += 2) even_string[i] = (save[i / 2] ? '#' : '.');
    for (int i = 0; i < n; i += 2) even_string[i] = '#';
    return res + (n + 1) / 2;
}

signed main() {

    cin.tie(0)->sync_with_stdio(0);
    
    string s;
    cin >> s;
    
    if (sz(s) == 1) {
        cout << "1\n#";
        return 0;
    }
    
    int x = solve_odd(s);
    int y = solve_even(s);
    
    // cout << y << " " << even_string << "\n";
    
    if (x < y) cout << x << "\n" << odd_string;
    else cout << y << "\n" << even_string;

}