#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000005
#define inf 0x3f3f3f3f

bool mbe;

int p[maxn],n;

bool vis[maxn];
void wkpre(vi&o,int x){
	For(i,1,n)vis[i]=0;
	For(i,0,x-1)vis[o[i]]=1;
	int p=0;
	For(i,1,n)if(vis[i])o[p]=i,++p;
}
void wksuf(vi&o,int x){
	For(i,1,n)vis[i]=0;
	For(i,n-x,n-1)vis[o[i]]=1;
	int p=n-x;
	For(i,1,n)if(vis[i])o[p]=i,++p;
}
bool check(int mid,bool out=0)
{
	vi o(n);For(i,0,n-1)o[i]=p[i+1];
	wkpre(o,mid-1),wksuf(o,mid);
	if(is_sorted(o.begin(),o.end())){
		if(out){
			For(i,1,mid-2)cout<<"S";
			cout<<"PS.";
		}
		return 1;
	}
	For(i,0,n-1)o[i]=p[i+1];
	wksuf(o,mid-1),wkpre(o,mid);
	if(is_sorted(o.begin(),o.end())){
		if(out){
			For(i,1,mid-2)cout<<"S";
			cout<<"SP.";
		}
		return 1;
	}
	return 0;
}

#define N 32000005
int rt0,rt1,tot;
int ls[N],rs[N],sum[N];
int rub[N],rubtot;
int newn(){
	if(rubtot)return rub[rubtot--];
	return assert(tot<=N-5),++tot;
}
void thro(int x){
	ls[x]=rs[x]=sum[x]=0;
	rub[++rubtot]=x;
}
void add(int&p,int l,int r,int x,int y){
	if(!p)p=newn();
	sum[p]+=y;
	if(l==r)return;
	int mid=l+r>>1;
	x<=mid?add(ls[p],l,mid,x,y):add(rs[p],mid+1,r,x,y);
}
int ask(int p,int l,int r,int ql,int qr){
	if(!p)return 0;
	if(l>=ql&&r<=qr)return sum[p];
	int mid=l+r>>1,res=0;
	if(ql<=mid)res+=ask(ls[p],l,mid,ql,qr);
	if(qr>mid)res+=ask(rs[p],mid+1,r,ql,qr);
	return res;
}

void split(int x,int&y,int k){
	if(!x)return;
	y=newn();
	int v=sum[ls[x]];
	if(k>v)split(rs[x],rs[y],k-v);
	else swap(rs[x],rs[y]);
	if(k<v)split(ls[x],ls[y],k);
	sum[y]=sum[x]-k;
	sum[x]=k;
}

int merge(int x,int y){
	if(!x||!y)return x|y;
	sum[x]+=sum[y],ls[x]=merge(ls[x],ls[y]),rs[x]=merge(rs[x],rs[y]),thro(y);
	return x;
}

void dfs(int p,int l,int r){
	if(!p||!sum[p])return;
	if(l==r)return cout<<l<<" ",void();int mid=l+r>>1;
	dfs(ls[p],l,mid),dfs(rs[p],mid+1,r);
}
bool med;

signed main()
{
//	printf("%.6lf\n",(&mbe-&med)/1024576.0);
//	freopen("data.in","r",stdin);
	n=read();
	For(i,1,n)p[i]=read();
	if(is_sorted(p+1,p+n+1)){
		puts(".");
		exit(0);
	}
	if(check((n+1)/2)){
		int l=2,r=(n+1)/2,res=r;
		while(l<=r){
			int mid=l+r>>1;
			if(check(mid))res=mid,r=mid-1;
			else l=mid+1;
		}
		check(res,1);exit(0);
	}
	//pspspsp
	
	int p0=1,p1=0;
	for(int op=1;p0+p1+2<=n;op^=1){
		if(op)p1+=2;else p0+=2;
	}
	if(n%2==0){
		For(i,1,n/2) add(rt0,1,n,p[i],1);
		For(i,n/2+1,n) add(rt1,1,n,p[i],1);
	}else{
		For(i,1,p0) add(rt0,1,n,p[i],1);
		For(i,p0+1,n) add(rt1,1,n,p[i],1);
	}
	
	
	pii res=mkp(inf,inf);
	For(i,(n+1)/2+1,n){
		if(i%2==0){
			//s
			p1+=2;
			int tmp=0;
		//	cout<<"split "<<n-p1<<endl;
			split(rt0,tmp,n-p1);
			rt1=merge(tmp,rt1);
		}else{
			//p
			p0+=2;
			int tmpl=rt1,tmpr=0;
		//	cout<<"SPLIT "<<p0-(n-p1+1)+1<<endl;
			split(tmpl,tmpr,p0-(n-p1+1)+1);
			rt0=merge(rt0,tmpl);
			rt1=tmpr;
		}
	//	cout<<"i: "<<i<<"\n";
	//	dfs(rt0,1,n),cout<<" ",dfs(rt1,1,n);
	//	cout<<sum[rt0]<<" "<<sum[rt1]<<"\n";
		if(ask(rt0,1,n,1,sum[rt0])==sum[rt0]
			 && ask(rt1,1,n,n-sum[rt1]+1,n)==sum[rt1]){
			 	res=min(res,mkp(i,0));
			 	break;
			 }
	}
	
	For(i,0,tot) ls[i]=rs[i]=sum[i]=0; rt0=rt1=0;
	//spspsps
	
	p0=0,p1=1;
	for(int op=0;p0+p1+2<=n;op^=1){
		if(op)p1+=2;else p0+=2;
	}
	if(n%2==0){
		For(i,1,n/2) add(rt0,1,n,p[i],1);
		For(i,n/2+1,n) add(rt1,1,n,p[i],1);
	}else{
		For(i,1,p0) add(rt0,1,n,p[i],1);
		For(i,p0+1,n) add(rt1,1,n,p[i],1);
	}
	
	For(i,(n+1)/2+1,n){
		if(i%2==0){
			//p
			p0+=2;
			int tmpl=rt1,tmpr=0;
			split(tmpl,tmpr,p0-(n-p1+1)+1);
			rt0=merge(rt0,tmpl);
			rt1=tmpr;
		}else{
			p1+=2;
			int tmp=0;
			split(rt0,tmp,n-p1);
			rt1=merge(tmp,rt1);
		}
		if(ask(rt0,1,n,1,sum[rt0])==sum[rt0]
			 && ask(rt1,1,n,n-sum[rt1]+1,n)==sum[rt1]){
			 	res=min(res,mkp(i,1));
			 	break;
			 }
	}
	
//	cout<<"res: "<<res.fi<<"\n";exit(0);
	For(i,1,res.fi)
		if((i&1)^(res.se))cout<<'P';
		else cout<<'S'; cout<<'.';
	return 0;
}