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

#define rep(i,a,b) for (int i = a; i < b; i++)
#define trav(a,b) for (auto a : b)
#define all(x) begin(x),end(x)
#define lld long long 
string table[30];
bool sw;
vector<int> nei[1000000];
bool visited[1000000];
vector<pair<int,vector<int>> >CC;
vector<int> comp;
vector<int> ONES;
bool side[1000000];
void DFS(int node){
	comp.push_back(node);
	visited[node]=true;
	trav(a,nei[node]){
		if(!visited[a])DFS(a);
	}
}
void Solve() {
	int n;
	cin>>n;
	sw=false;
	rep(i,0,n){
		cin>>table[i];
	}
	int cnt=0;
	rep(i,0,n){
		rep(j,i+1,n){
			if(table[i][j]!='?'){
				if(table[i][j]=='F')cnt++;
			}
		}
	}
	if(4*cnt>=n){
		sw=true;
		rep(i,0,n){
			rep(j,0,n){
				if(table[i][j]=='F')table[i][j]='S';
				else{
					if(table[i][j]=='S')table[i][j]='F';
				}
			}
		}
	}
	// cout<<sw<<endl;
	rep(i,0,n){
		rep(j,0,n){
			if(table[i][j]=='S'){
				nei[i].push_back(j);
			}
		}
	}
	rep(i,0,n){
		if(!visited[i]){
			comp.clear();
			
			DFS(i);
			CC.push_back({comp.size(),comp});
		}
	}
	sort(CC.begin(),CC.end());
	reverse(CC.begin(),CC.end());
	int tot=0;
	rep(i,0,(int)CC.size()){
		if((tot+CC[i].first)*4<=3*n+3){
			tot+=CC[i].first;
			ONES.push_back(i);
		}
	}
	rep(i,0,n)side[i]=0;
	trav(a,ONES){
		trav(b,CC[a].second){
			side[b]=1;
		}
	}
	// rep(i,0,n)cout<<side[i]<<" ";
	// cout<<endl;
	rep(i,0,n){
		rep(j,0,n){
			if(i!=j){
				if(side[i]!=side[j]){
					assert(table[i][j]=='F' || table[i][j]=='?');
					table[i][j]='F'; 
				}else{
					if(table[i][j]=='?')table[i][j]='S';
				}
			}
		}
	}
	if(sw){
		rep(i,0,n){
			rep(j,0,n){
				if(table[i][j]=='F')table[i][j]='S';
				else{
					 if(table[i][j]=='S')table[i][j]='F';
				 }
			}
		}
	}
	rep(i,0,n)cout<<table[i]<<"\n";
}


signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt = 1;
	// cin >> tt;
	while (tt--) Solve();
	return 0;
}