/**
	author:  shobonvip
	created: 2026.09.19 15:04:42
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}


vector<vector<char>> solve(int n, string s) {

	vector<vector<char>> ans(n, vector<char>(n,'#'));

	rep(i,0,n) ans[i][0] = '.';
	rep(i,0,n) ans[n-1][i] = '.';
	rep(i,0,n) ans[1][i] = '.';
	rep(i,1,n) ans[i][n-1] = '.';

	if (1 < (int)s.size()+1) {
		if (s[0]=='o') ans[n-1][0] = '.';
		else ans[n-1][0] = '#';
	}
	if (2 < (int)s.size()+1) {
		if (s[1]=='o') ans[1][n-1] = '.';
		else ans[1][n-1] = '#';
	}

	rep(i,0,n/4) {
		int g = n-4-3*i;
		int x = g;
		int y = 1;
		rep(z,0,4*(i+1)) {
			ans[x][y] = '.';
			if (z%2==0) y++;
			else x++;
		}
		while (x<n-1) {
			ans[x][y] = '.';
			x++;
		}
		if (4*i+3 < (int)s.size()+1) {
			if (s[4*i+2]=='o') ans[n-3-3*i][1] = '.';
			else ans[n-3-3*i][1] = '#';
		}
		if (4*i+5 < (int)s.size()+1) {
			if (s[4*i+4]=='o') ans[n-4-3*i][1] = '.';
			else ans[n-4-3*i][1] = '#';
		}
		
	}

	rep(i,0,n/4) {
		int g = n-4-3*i;
		int x = 2;
		int y = g;
		rep(z,0,4*(i+1)) {
			ans[x][y] = '.';
			if (z%2==0) x++;
			else y++;
		}
		while (y<n-1) {
			ans[x][y] = '.';
			y++;
		}
		if (4*i+4 < (int)s.size()+1) {
			if (s[4*i+3]=='o') ans[2][n-3-3*i] = '.';
			else ans[2][n-3-3*i] = '#';
		}
		if (4*i+6 < (int)s.size()+1) {
			if (s[4*i+5]=='o') ans[2][n-4-3*i] = '.';
			else ans[2][n-4-3*i] = '#';
		}
	}


	return ans;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	string s; cin >> s;
	int n = (int)s.size();
//	int n; cin >> n;
	vector<vector<char>> ans = solve(n+16,s);
	cout << (int)ans.size() << '\n';
	rep(i,0,(int)ans.size()){
		rep(j,0,(int)ans[0].size()){
			cout << ans[i][j];
		}
		cout << '\n';
	}
}