#include <cstdio>
#include <utility>
#include <cctype>
#include <array>
#include <functional>
#include <climits>
using namespace std;

#ifdef __linux
#define _U(s) s##_unlocked
#else
#define _U(s) _##s##_nolock
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
#define gcu _U(getchar)
#define pcu _U(putchar)
#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept
#define _T template <typename T>
#define _HT template <typename H,typename... T>
#define _OP(t) inline operator t()
struct _in {
#ifdef _GLIBCXX_STRING
	_OP(string){string s;char c;while(isspace(c = gcu()));do{s+=c;}while(c=gcu(),c!=' '&&c!='\n'&&c!=EOF);return s;}
#define _S
#endif
	_OP(char){char c=gcu();gcu();return c;}
	_OP(double){double d; scanf("%lf",&d); gcu();return d;}
	_T _OP(T){T n{},m{1},c;while(isspace(c = gcu()));if(c=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}
} in;
#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)
#ifdef _S
_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}
#endif
_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}
_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}
#define _OUT(...) _DEF(void,out,__VA_ARGS__)
#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)
_OUT(bool b){pcu('0'+b);}
_OUT(const char *s){while(*s)pcu(*s++);}
_OUT(char c){pcu(c);}
#ifdef _S
_OUT(string &s){for(char c:s)pcu(c);}
#endif
_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;
	if(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}
_OUTL(){out('\n');}
#ifdef _GLIBCXX_VECTOR
	_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);}
#endif
_HT _OUT(H &&h, T... t){out(h);out(t...);}
template <typename... T> _OUTL(T... t){out(t...);outl();}
struct range{
	int e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}
	struct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}
		it& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};
#define times(i,n) for(int i=n;i;i--)

int main() {
	array<array<char, 10>, 10> T;
	range r8(1, 9);
	for (int i: range(10))
		T[0][i] = T[9][i] = T[i][0] = T[i][9] = ' ';
	for (auto i: r8) {
		for (char j: r8)
			T[i][j] = gcu();
		gcu();
	}
	int dx[] {0, 1, 1, 1, 0, -1, -1, -1},
		dy[] {-1, -1, 0, 1, 1, 1, 0, -1};
	char pt[] {'o', 'x'};
	function<bool(int, int, int, int)> flip{[&] (int x, int y, int k, int p) {
		x += dx[k], y += dy[k];
		if (T[y][x] != pt[!p])
			return T[y][x] == pt[p];
		bool r = flip(x, y, k, p);
		if (r)
			T[y][x] = pt[p];
		return r;
	}};
	for (int p {}, b[2]{1, 1}; b[0] || b[1]; p ^= 1) {
		struct { int c, x, y; } m {};
		for (int i: r8)
			for (int j: r8)
				if (T[i][j] == '.') {
					int c {};
					for (int k: range(8)) {
						int d {}, x {j + dx[k]}, y {i + dy[k]};
						for (; T[y][x] == pt[!p]; x += dx[k], y += dy[k])
							d++;
						if (T[y][x] == pt[p])
							c += d;
					}
					if (c && ((p == 0 && c > m.c) || (p == 1 && c >= m.c)))
						m = {c, j, i};
				}
		if (m.c) {
			b[p] = 1;
			T[m.y][m.x] = pt[p];
			for (int k: range(8))
				flip(m.x, m.y, k, p);
		} else
			b[p] = 0;
	}
	for (int i: r8) {
		for (int j: r8)
			out(T[i][j]);
		outl();
	}
}


Measured memory_bytes: 2632