// UUID: 80845514-f25b-4298-90b3-e2070fa05594
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")

#define pii pair<int ,int>
#define fi first
#define se second

int n, m, cnt = 0;
vector<vector<int>> vis(203, vector<int>(203));
vector<vector<pii>> match(203, vector<pii>(203, {-1, -1}));
vector<vector<vector<pii>>> adj(203, vector<vector<pii>>(203));

bool dfs(int x, int y) {
	if (vis[x][y]==cnt)return false;
	vis[x][y]=cnt;
	for (pii u : adj[x][y]) {
		if (make_pair(-1, -1)==match[u.fi][u.se]||dfs(match[u.fi][u.se].fi, match[u.fi][u.se].se)) {
			match[u.fi][u.se] = {x, y};
			return true;
		}
	}
	return false;
}

int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		string s;
		cin >> s;
		for (int j = 1; j <= m; j++) {
			char c = s[j-1];
			if (c=='\\') {
				if (i%2) {
					adj[i][j].push_back({i+1, j+1});
				} else {
					adj[i+1][j+1].push_back({i, j});
				}
			}
			if (c=='/') {
				if (i%2) {
					adj[i][j+1].push_back({i+1, j});
				} else {
					adj[i+1][j].push_back({i, j+1});
				}
			}
		}
	}
	vector<vector<char>> ansv(n+1, vector<char>(m+1, '.'));
	int ans = 0;
	for (int i = 1; i <= n+1; i+=2) {
		for (int j = 1; j <= m+1; j++) {
			cnt++;
			ans += dfs(i, j);
		}
	}
	for (int i = 2; i <= n+1; i+=2) {
		for (int j = 1; j <= m+1; j++) {
			if (match[i][j]!=make_pair(-1, -1)) {
				if (match[i][j]==make_pair(i+1, j+1)) {
					ansv[i][j]='\\';
				}
				if (match[i][j]==make_pair(i-1, j+1)) {
					ansv[i-1][j]='/';
				}
				if (match[i][j]==make_pair(i+1, j-1)) {
					ansv[i][j-1]='/';
				}
				if (match[i][j]==make_pair(i-1, j-1)) {
					ansv[i-1][j-1]='\\';
				}
			}
		}
	}
	cout << ans << '\n';
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cout << ansv[i][j];
		}
		cout<<'\n';
	}
}