#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <iomanip>
#include <cassert>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

int n, cnt = 0, tmp;
char str[105];
ll res;

void dfs(ll s, int dep, int c)
{
    if (c > tmp) return;
    if (dep == n)
    {
        if (c < tmp) tmp = c, res = s;
        return;
    }

    dfs(s | (1ll << dep), dep + 1, c + 1);
    if ((s >> dep) & 1) return;
    for (int x = 1; x <= dep / 2; x++)
        if (!(s & (1ll << (dep - x))) && !(s & (1ll << (dep - x - x)))) return;
    dfs(s, dep + 1, c);
}

int main()
{
    // freopen(".in", "r", stdin);
    // freopen("k.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif

    cin >> str, n = strlen(str); int m1 = 0, m2 = 0;
    if (n == 1) return cout << "1\n#", 0;
    ll S1 = 0, S2 = 0;
    for (int i = 0; i < n; i += 2)
    {
        if (str[i] == '#') S1 |= (1ll << m1);
        m1++;
    }
    for (int i = 1; i < n; i += 2)
    {
        if (str[i] == '#') S2 |= (1ll << m2);
        m2++;
    }
    
    tmp = 1005, n = m1, dfs(S1, 0, 0);
    int ans = tmp + m2; ll R = res;

    tmp = 1005, n = m2, dfs(S2, 0, 0);
    cout << min(ans, m1 + tmp) << "\n";
    if (ans < m1 + tmp)
    {
        int c = 0;
        for (int i = 0; i < m1 + m2; i++)
        {
            if (i & 1) cout << '#';
            else cout << (((R >> c) & 1) ? '#' : '.'), c++;
        }
    }
    else
    {
        int c = 0;
        for (int i = 0; i < m1 + m2; i++)
        {
            if (!(i & 1)) cout << '#';
            else cout << (((res >> c) & 1) ? '#' : '.'), c++;
        }
    }
    return 0;
}