#include <bits/stdc++.h>
using namespace std;
#define int long long
namespace Solve {
    int n;
    int bst;
    void Dfs(int x, int cho, int cant) {
        if (x == n) {
            if (__builtin_popcountll(cho) > __builtin_popcountll(bst)) bst = cho;
            return;
        }
        Dfs(x + 1, cho, cant);
        if (cant >> x & 1) return;
        cho |= 1ll << x;
        for (int i = 0; i < x; ++i) if ((cho >> i & 1) && 2 * x - i < n) {
            cant |= 1ll << (2 * x - i);
        }
        Dfs(x + 1, cho, cant);
    }
    pair<int, string> Solve(string s) {
        n = s.size();
        int cant = 0;
        for (int i = 0; i < n; ++i) if (s[i] == '#') cant |= 1ll << i;
        bst = 0;
        Dfs(0, 0, cant);
        int rst = __builtin_popcountll(bst);
        string plan;
        for (int i = 0; i < n; ++i) plan.push_back(bst >> i & 1 ? '.' : '#');
        return {rst, plan};
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    string s;
    cin >> s;
    // s = string(64, '.');
    int n = s.size();
    if (n == 1) {
        cout << 1 << endl << '#' << endl;
        return 0;
    }
    int ans = -1;
    string plan;
    for (int d = 0; d < 2; ++d) {
        string ns;
        for (int i = d; i < n; i += 2) {
            ns.push_back(s[i]);
        }
        auto rst = Solve::Solve(ns);
        if (rst.first > ans) {
            ans = rst.first;
            reverse(rst.second.begin(), rst.second.end());
            plan = "";
            for (int i = 0; i < n; ++i)
                if ((i - d) % 2 == 0) { 
                    plan.push_back(rst.second.back()); 
                    rst.second.pop_back(); 
                } else { 
                    plan.push_back('#');
                }
        }
    }
    cout << n - ans << endl << plan << endl;
    return 0;
}