/**
	author:  shobonvip
	created: 2026.09.19 13:12:57
**/

#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;
}

void solve(int n, vector<vector<int>> a) {
	vector<vector<int>> b(n, vector<int>(n));
	vector<vector<int>> state(n, vector<int>(n));
	vector<vector<int>> bad(n, vector<int>(n, 0));
	rep(i,0,n){
		rep(j,0,n) {
			if (a[i][j]>0) bad[i][j]=1;
		}
	}

	auto flip = [&](int i, int j) -> void {
		state[i][j] ^= 1;
		int v;
		if (state[i][j] == 1) v = 1;
		else v = -1;

		rep(x,i-1,i+2) {
			rep(y,j-1,j+2) {
				if (x < 0 || x >= n) continue; 
				if (y < 0 || y >= n) continue; 
				b[x][y] += v;
				if (state[x][y] == 1) {
					if (b[x][y] > a[x][y]) bad[x][y] = 1;
					else bad[x][y] = 0;
				} else {
					if (b[x][y] < a[x][y]) bad[x][y] = 1;
					else bad[x][y] = 0;
				}
			}
		}
	};

	rep(i,0,n) {
		rep(j,0,n) {
			flip(i, j);
		}
	}

	auto flip_dfs = [&](auto self,int i,int j) -> void {
		flip(i, j);	
		rep(x,i-1,i+2) {
			rep(y,j-1,j+2) {
				if (x < 0 || x >= n) continue; 
				if (y < 0 || y >= n) continue; 
				if (bad[x][y] == 1) {
					self(self,x,y);
				}
			}
		}
	};

	rep(i,0,n){
		rep(j,0,n) {
			if (bad[i][j]) {
				flip_dfs(flip_dfs,i,j);
			}
		}
	}

	rep(i,0,n) {
		rep(j,0,n) {
			if (state[i][j] == 1) cout << 'o';
			else cout << '.';
		}
			cout << '\n';
	}
}

void fast(int n, vector<vector<int>> a) {
	rep(i,0,n) {
		rep(j,0,n) {
			if (a[i][j] >= 5) cout << 'o';
			else cout << '.';
		}
		cout << '\n';
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<vector<int>> a(n, vector<int>(n));
	rep(i,0,n) {
		rep(j,0,n) {
			//a[i][j] = random_device()()%10;
			char x; cin >> x;
			a[i][j] = x - '0';
//			cout << a[i][j] << ' ';
		}
//		cout << endl;
	}

	solve(n, a);
	//fast(n, a);
}