#include<bits/stdc++.h>
using namespace std;
const int MOD=993244853;
int S=100,pw[1111111];
struct node
{
	int siz;
	int h;
	int lson,rson;
}pool[21000050];
void upd(int cur)
{
	pool[cur].siz=0;
	pool[cur].h=0;
	if(pool[cur].lson)
	{
		pool[cur].h=(pool[cur].h+1ll*pool[pool[cur].lson].h*pw[pool[cur].siz])%MOD;
		pool[cur].siz+=pool[pool[cur].lson].siz;
	}
	if(pool[cur].rson)
	{
		pool[cur].h=(pool[cur].h+1ll*pool[pool[cur].rson].h*pw[pool[cur].siz])%MOD;
		pool[cur].siz+=pool[pool[cur].rson].siz;
	}
}
int top;
queue<int> recycle;
int nn(int l,int r)
{
	int tmp;
	if(recycle.empty())
	{
		tmp=++top;
//		if(top%100000==0)cerr<<"mem "<<top<<endl;
	}
	else tmp=recycle.front(),recycle.pop();
	pool[tmp].lson=pool[tmp].rson=0;
	pool[tmp].siz=1;pool[tmp].h=l;
	return tmp;
}
int build(int l,int r,int pos)
{
	int tmp=nn(l,r);
//	cerr<<"build "<<tmp<<' '<<l<<' '<<r<<endl;
	if(l==r)return tmp;
	int mid=(l+r)/2;
	if(pos<=mid)pool[tmp].lson=build(l,mid,pos);
	else pool[tmp].rson=build(mid+1,r,pos);
	upd(tmp);
	return tmp;
}
int merge(int u,int v,int l,int r)
{
	if(not u or not v)return u|v;
//	cerr<<"merge "<<u<<' '<<v<<' '<<l<<' '<<r<<endl;
	int mid=(l+r)/2;
	pool[u].lson=merge(pool[u].lson,pool[v].lson,l,mid);
	pool[u].rson=merge(pool[u].rson,pool[v].rson,mid+1,r);
	recycle.push(v);
	upd(u);
	return u;
}
pair<int,int> split(int cur,int lsiz,int l,int r)
{
//	cerr<<"split "<<cur<<' '<<lsiz<<' '<<l<<' '<<r<<endl;
	if(lsiz==0)return {0,cur};
	if(lsiz==pool[cur].siz)return {cur,0};
	int ex=nn(l,r);
	int mid=(l+r)/2;
	int ls=pool[cur].lson,rs=pool[cur].rson;
	if(pool[ls].siz<=lsiz)
	{
		auto [curr,exr]=split(rs,lsiz-pool[ls].siz,mid+1,r);
		pool[cur].rson=curr;
		pool[ex].rson=exr;
	}
	else
	{
		swap(pool[cur].rson,pool[ex].rson);
		auto [curl,exl]=split(ls,lsiz,l,mid);
		pool[cur].lson=curl;
		pool[ex].lson=exl;
	}
	upd(cur);
	upd(ex);
	return make_pair(cur,ex);
}
int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);
	int n;
	cin>>n;
	pw[0]={1};
	vector<int> a(n+5);
	for(int i=1;i<=n;i++)
	{
		a[i]=n-i+1;
		cin>>a[i];
		pw[i]=1ll*pw[i-1]*S%MOD;
	}
	auto solve=[&](int ty)
	{
//		cerr<<"solve "<<ty<<endl;
		top=0;while(not recycle.empty())recycle.pop();
		deque<int> dq;
		int now=0,target=0;
		for(int i=1;i<=n;i++)
		{
			target=(target+1ll*pw[i-1]*i)%MOD;
		}
		for(int i=1;i<=n;i++)
		{
			int nd=build(1,n,a[i]);
			dq.push_back(nd);
			now=(now+1ll*pw[i-1]*pool[nd].h)%MOD;
		}
		if(now==target)return 0;
		for(int i=1;i<=n;i++,ty^=1)
		{
//			cerr<<"round "<<i<<" type "<<ty<<endl;
//			for(auto idx:dq){cerr<<idx<<' '<<pool[idx].h<<endl;}//cerr<<endl;
			if(i==1)continue;
			if(ty==0)
			{
				int lsiz=0;
				int tmp=dq.front();dq.pop_front();
//				cerr<<"pop0 "<<tmp<<' '<<pool[tmp].siz<<endl;
				now=(now-1ll*pw[lsiz]*pool[tmp].h%MOD+MOD)%MOD;
//				cerr<<"now "<<now<<endl;
				lsiz+=pool[tmp].siz;
				while(lsiz<i)
				{
					int tmp2=dq.front();dq.pop_front();
//					cerr<<"pop "<<tmp2<<' '<<pool[tmp2].siz<<endl;
					now=(now-1ll*pw[lsiz]*pool[tmp2].h%MOD+MOD)%MOD;
//					cerr<<"now "<<now<<endl;
					if(lsiz+pool[tmp2].siz>=i)
					{
//						cerr<<"lsiz "<<i-lsiz<<endl;
						auto [L,R]=split(tmp2,i-lsiz,1,n);
						if(R)
						{
//							cerr<<"splitted "<<R<<' '<<pool[R].h<<endl;
							dq.push_front(R);
							now=(now+1ll*pw[i]*pool[R].h)%MOD;
						}
						int m=merge(tmp,L,1,n);
//						cerr<<"merged "<<m<<' '<<pool[m].siz<<' '<<pool[m].h<<endl;
						dq.push_front(m);
						now=(now+1ll*pw[0]*pool[m].h)%MOD;
					}
					else
					{
						tmp=merge(tmp,tmp2,1,n);
					}
					lsiz+=pool[tmp2].siz;
				}
			}
			else
			{
				int lsiz=n;
				int tmp=dq.back();dq.pop_back();
//				cerr<<"pop0 "<<tmp<<' '<<pool[tmp].siz<<endl;
				lsiz-=pool[tmp].siz;
				now=(now-1ll*pw[lsiz]*pool[tmp].h%MOD+MOD)%MOD;
				while(n-lsiz<i)
				{
					int tmp2=dq.back();dq.pop_back();
//					cerr<<"pop "<<tmp2<<' '<<pool[tmp2].siz<<endl;
					lsiz-=pool[tmp2].siz;
					now=(now-1ll*pw[lsiz]*pool[tmp2].h%MOD+MOD)%MOD;
					if(n-lsiz>=i)
					{
//						cerr<<"lsiz "<<n-i-lsiz<<endl;
						auto [L,R]=split(tmp2,n-i-lsiz,1,n);
						if(L)
						{
//							cerr<<"splitted "<<L<<endl;
							dq.push_back(L);
							now=(now+1ll*pw[lsiz]*pool[L].h)%MOD;
						}
						int m=merge(R,tmp,1,n);
//						cerr<<"merged "<<m<<endl;
						dq.push_back(m);
						now=(now+1ll*pw[n-i]*pool[m].h)%MOD;
					}
					else
					{
						tmp=merge(tmp2,tmp,1,n);
					}
				}
			}
//			cerr<<now<<','<<target<<endl;
			if(now==target)return i;
		}
		return n;
	};
	int l0=solve(0);
	int l1=solve(1);
//	cerr<<"ans "<<l0<<' '<<l1<<endl;
	if(l0<l1)
	{
		for(int i=1;i<=l0;i++)cout<<"SP"[i%2];
		cout<<".";
	}
	else
	{
		for(int i=1;i<=l1;i++)cout<<"PS"[i%2];
		cout<<".";
	}
	return 0;
}