import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		int n=8;
		char[][] map=ir.nextCharMap(n,n);
		int p=-1;
		for(int m=0;;m^=1){
			int ma=0,x=-1,y=-1;
			if(m==0){
				for(int i=n-1;i>=0;i--){
					for(int j=n-1;j>=0;j--){
						if(map[i][j]!='.')
							continue;
						int c=get(i,j,m,map,false);
						if(c>=ma){
							ma=c;
							x=i;
							y=j;
						}
					}
				}
			}
			else{
				for(int i=0;i<n;i++){
					for(int j=0;j<n;j++){
						if(map[i][j]!='.')
							continue;
						int c=get(i,j,m,map,false);
						if(c>=ma){
							ma=c;
							x=i;
							y=j;
						}
					}
				}
			}
			if(ma==0&&p==0)
				break;
			if(ma!=0)
				get(x,y,m,map,true);
			p=ma;
		}
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				out.print(Character.toString(map[i][j]));
			}
			out.println();
		}
	}

	static int get(int x,int y,int m,char[][] map,boolean reverse){
		if(reverse)
			map[x][y]=conv(m);
		int ret=0;
		for(int dx=-1;dx<=1;dx++){
			for(int dy=-1;dy<=1;dy++){
				if(dx==0&&dy==0)
					continue;
				for(int i=1;;i++){
					int nx=x+dx*i;
					int ny=y+dy*i;
					if(!(nx>=0&&ny>=0&&nx<map.length&&ny<map.length))
						break;
					if(map[nx][ny]=='.')
						break;
					if(map[nx][ny]==conv(m)){
						ret+=i-1;
						if(reverse){
							for(int j=1;j<i;j++){
								map[x+dx*j][y+dy*j]=conv(m);
							}
						}
						break;
					}
				}
			}
		}
		return ret;
	}

	static char conv(int m){
		return m==0?'o':'x';
	}

	public static void main(String[] args) throws Exception {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}
	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}


Measured memory_bytes: 24676