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

void dfs(vector<vector<int>> &g,vector<int> &color , int s)
	{
	for(int x:g[s])
		{
		if(color[x]==-1)
			{
			color[x]=1^color[s];
			dfs(g,color,x);
			}
		}
	}

int main() {
	int n;
	cin>>n;
	map<int,vector<pair<int,int>>> mx,my;
	for(int i=0;i<n;i++)
		{
		int x,y;cin>>x>>y;
		mx[x].push_back({y,i});
		my[y].push_back({x,i});
		}
	vector<vector<int>> g(n);
	for(auto [idc,v] : mx)
		{
		sort(v.begin(),v.end());
		for(int i=0;i<v.size()-1;i+=2)
			{
			int a=v[i].second;
			int b=v[i+1].second;
			g[a].push_back(b);
			g[b].push_back(a);
			}
		}
	for(auto [idc,v] : my)
		{
		sort(v.begin(),v.end());
		for(int i=0;i<v.size()-1;i+=2)
			{
			int a=v[i].second;
			int b=v[i+1].second;
			g[a].push_back(b);
			g[b].push_back(a);
			}
		}
	vector<int> color(n,-1);//-1 ures 0 L 1 F
	for(int i=0;i<n;i++)
		{
		if(color[i]!=-1)continue;
		color[i]=1;
		dfs(g,color,i);
		}
	for(int x:color)cout<<((x) ? 'F' : 'L');
}