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

using ll=long long;
using ldub=long double;
using lldub=__float128;
using str=string;

using mint=modint;

template<class T=ll>
using tup2=tuple<T,T>;
template<class T=ll>
using tup3=tuple<T,T,T>;
template<class T=ll>
using tup4=tuple<T,T,T,T>;
template<class T=ll>
using tup5=tuple<T,T,T,T,T>;
template<class T=ll>
using tup6=tuple<T,T,T,T,T,T>;
template<class T=ll>
using tup7=tuple<T,T,T,T,T,T,T>;

template<class T=ll>
using vec=vector<T>;
template<class T=ll>
using vec2=vector<vec<T>>;
template<class T=ll>
using vec3=vector<vec2<T>>;
template<class T=ll>
using vec4=vector<vec3<T>>;
template<class T=ll>
using vec5=vector<vec4<T>>;
template<class T=ll>
using vec6=vector<vec5<T>>;

template<class T>
using que=queue<T>;
template<class T>
using Pque=priority_queue<T>;
template<class T>
using pque=priority_queue<T, vector<T>, greater<T>>;

struct Edge{
  ll from,to,w=1,num=-1;
};
using gvec=vector<Edge>;
using gvec2=vector<gvec>;

template<class T>
bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,T b){if(b<a){a=b;return 1;}return 0;}

#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define tup make_tuple
#define low lower_bound
#define pops(a) __builtin_popcountll(a)
#define ctz(a) __builtin_ctzll(a)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define nperm(v) next_permutation(all(v))
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YN(f) cout << ((f)?"Yes":"No") << endl

const int IINF=2e9;
const ll INF=4e18;

#ifndef LOCAL
#define debug(x)
#endif




// =================================================




tup2<ll> grid_move(ll h,ll w,ll k){
  if(k==0) return tup2(h+1,w);
  if(k==1) return tup2(h,w+1);
  if(k==2) return tup2(h-1,w);
  if(k==3) return tup2(h,w-1);
}
ll out(ll h,ll w,ll H,ll W){return h<0||H<=h||w<0||W<=w;}

void solve(){
  ll N;
  cin >> N;
  vec<str> S(N);
  for(ll i=0;i<N;i++) cin >> S[i];
  vec2 A(N,vec(N));
  for(ll i=0;i<N;i++) for(ll j=0;j<N;j++) A[i][j]=S[i][j]-'0';
  vec2 C(N,vec(N));
  vec2<char> F(N,vec<char>(N));
  que<tup2<ll>> BFS;
  for(ll i=0;i<N;i++) for(ll j=0;j<N;j++) BFS.push(tup(i,j));
  while(!BFS.empty()){
    auto [i,j]=BFS.front();
    BFS.pop();
    if(F[i][j]==0){
      if(A[i][j]<=C[i][j]) continue;
      F[i][j]=1;
      for(ll di=-1;di<=1;di++){
        for(ll dj=-1;dj<=1;dj++){
          ll ni=i+di,nj=j+dj;
          if(out(ni,nj,N,N)) continue;
          C[ni][nj]++;
          if(F[ni][nj]==0&&A[ni][nj]>C[ni][nj]) BFS.push(tup(ni,nj));
          if(F[ni][nj]==1&&A[ni][nj]<C[ni][nj]) BFS.push(tup(ni,nj));
        }
      }
    }
    if(F[i][j]==1){
      if(A[i][j]>=C[i][j]) continue;
      F[i][j]=0;
      for(ll di=-1;di<=1;di++){
        for(ll dj=-1;dj<=1;dj++){
          ll ni=i+di,nj=j+dj;
          if(out(ni,nj,N,N)) continue;
          C[ni][nj]--;
          if(F[ni][nj]==0&&A[ni][nj]>C[ni][nj]) BFS.push(tup(ni,nj));
          if(F[ni][nj]==1&&A[ni][nj]<C[ni][nj]) BFS.push(tup(ni,nj));
        }
      }
    }
  }
  for(ll i=0;i<N;i++){
    for(ll j=0;j<N;j++){
      if(F[i][j]==0) cout << '.';
      else cout << 'o';
    }
    cout << endl;
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  mint::set_mod(998244353);
  // mint::set_mod(1000000007);

  ll T=1;
  // cin >> T;
  while(T--) solve();
  return 0;
}