#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define PB push_back
#define X first
#define Y second
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int maxp(vector<vi> um)
{
	int n=um.size();
	assert((int)um[0].size()==n);
	vi im(n);
	for (int i=0;i<n;++i) for (int j=0;j<n;++j)
	{
		assert(um[i][j]==um[j][i]);
		assert(i!=j || um[i][j]==0);
		if (um[i][j]) im[i]+=1<<j;
	}
	array<int,24> pr;
	for (int i=0;i<24;++i) pr[i]=0;
	vector<array<int,24>> v(1<<n,pr);
	for (int i=0;i<n;++i) v[(1<<i)][i]=1;
	int mp=0;
	for (int b=0;b<(1<<n);++b) for (int i=0;i<n;++i) if (v[b][i]) for (int j=0;j<n;++j) if (((im[i]>>j)&1) && !((b>>j)&1))
	{
		v[b|(1<<j)][j]=max(v[b|(1<<j)][j],v[b][i]+1);
		mp=max(mp,v[b][i]+1);
	}
	return mp;
}
/**
int mcomp(vector<vi> um)
{
	int r1=maxp(um);
	//cout<<r1<<endl;
	int n=um.size();
	for (int i=0;i<n;++i) for (int j=0;j<n;++j) if (i!=j) um[i][j]^=1;
	return max(r1,maxp(um));
}
**/

int n;

vector < pii > v[2];
int flip = 0;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for(int i = 0;i < n;i++) {
		for(int j = 0;j < n;j++) {
			char c; cin >> c;
			if(i < j && c != '?' && c != '.') {
				v[c == 'F'].PB({i, j});
			}
		}
	}
	if((int)v[0].size() < (int)v[1].size()) {
		flip = 1; swap(v[0], v[1]);
	}
	int lo = n - ((3 * n + 3) / 4 - (int)v[1].size()) / 2, hi = (3 * n + 3) / 4 + 1;
	for(int msk = 0;msk < (1 << n);msk++) {
		if(__builtin_popcount(msk) < lo || __builtin_popcount(msk) > hi) continue;
		int los = 0;
		for(auto tmp : v[0])
			if((!!(msk & (1 << tmp.X))) != (!!(msk & (1 << tmp.Y)))) los = 1;
		if(los) continue;
		vector < vi > ans(n, vi(n, 0));	
		for(int i = 0;i < n;i++) {
			for(int j = 0;j < n;j++) {
				if(i != j) ans[i][j] = (!!(msk & (1 << i))) != (!!(msk & (1 << j)));
			}
		}
		for(auto tmp : v[0]) ans[tmp.X][tmp.Y] = 0, ans[tmp.Y][tmp.X] = 0;
		for(auto tmp : v[1]) ans[tmp.X][tmp.Y] = 1, ans[tmp.Y][tmp.X] = 1;
			
		if(1) {
			for(int i = 0;i < n;i++) {
				for(int j = 0;j < n;j++) {
					if(i == j) cout << ".";
					else cout << ((ans[i][j] ^ flip) ? "F" : "S");
				}
				cout << "\n";
			}
		}
		return 0;
	}

}