#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAX_N = 1 << 16;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    string s, cur, ans;
    cin >> s; cur = s;
    if ((int)s.size() == 1) {
        cout << "1\n#\n";
        return 0;
    }
    for (auto &ch : cur) ch = '#';
    ans = cur;
    int n = s.size(), bs = 0;
    auto dfs = [&](auto &&dfs, int i, int m, int d, int cnt, ll mask) -> void {
        if (i == m) {
            if (bs < cnt) {
                bs = cnt;
                ans = cur;
            }
            return ;
        }
        if ((m - i + 1 >> 1) + cnt < bs) return ;
        mask <<= 1;
        if (s[i << 1 | d] != '#') {
            bool flag = true;
            for (int j = 1; j <= (i >> 1); j ++) {
                if ((mask >> j & 1) && (mask >> (j << 1) & 1)) {
                    flag = false;
                    break;
                }
            }
            if (flag) {
                cur[i << 1 | d] = '.';
                dfs(dfs, i + 1, m, d, cnt + 1, mask | 1);
                cur[i << 1 | d] = '#';
            }
        }
        dfs(dfs, i + 1, m, d, cnt, mask);
    };
    dfs(dfs, 0, n + 1 >> 1, 0, 0, 0);
    dfs(dfs, 0, n >> 1, 1, 0, 0);
    cout << n - bs << '\n' << ans << '\n';
    
    return 0;
}