#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

void dfs(int i, int &n, vector<bool> &used, int &cnt, int &ans, string &s, string &t)
{
    if(cnt >= ans) return;

    if(i >= n)
    {
        ans = cnt;
        for(int k=0; k<n; k++)
        {
            if(used[k] || (k % 2) != (i % 2)) t[k] = '#';
            else t[k] = '.';
        }
        return;
    }

    if(s[i] == '#')
    {
        dfs(i + 2, n, used, cnt, ans, s, t);
        return;
    }

    bool ok = true;

    for(int j = 2; i - 2 * j >= 0; j += 2)
    {
        if(!ok) break;
        if(!used[i - j] && !used[i - 2 * j]) ok = false;
    }

    if(ok) dfs(i + 2, n, used, cnt, ans, s, t);

    used[i] = true;
    cnt++;
    dfs(i + 2, n, used, cnt, ans, s, t);
    used[i] = false;
    cnt--;
}

int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	string s;
	cin >> s;

	int n = s.size(), ans = n;
	string t(n, '#');

	if(n == 1)
    {
        cout << "1\n#";
        return 0;
    }

	vector<bool> used(n, false);
	int cnt = 0, cnto = 0, cnte = 0;

	for(int i=0; i<n; i++)
    {
        if(s[i] == '#')
        {
            used[i] = true;

            if(i % 2 == 0) cnto++;
            else cnte++;
        }
    }

	//Odd Case
	cnt = cnto + n / 2;
	dfs(0, n, used, cnt, ans, s, t);

	for(int i=0; i<n; i++) if(s[i] == '#') used[i] = true;

	//Even Case
	cnt = cnte + (n + 1) / 2;
	dfs(1, n, used, cnt, ans, s, t);

	cout << ans << "\n";
	cout << t;
}
//................................................................