#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define pb push_back
#define all(v) v.begin(),v.end()
const ll M=5e5+10;
const ll inf=2e18;
const ll mod=1e9+7;
ll pow(ll x,ll y,ll mod=mod){
    x%=mod;
    ll res=1;
    while(y>0){
        if((y&1)>0)
        res*=x,res%=mod;
        x*=x,x%=mod;
        y/=2;
    }
    return res;
}
ll n,m,c[M],vis[M],mat[300][300];
vii adj[M];
void dfs(ll x,ll col=0){
    c[x]=col;
    vis[x]=1;
    for(auto it:adj[x]){
        if(!vis[it])
        dfs(it,(col^1));
    }
}
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);    
    ll TC=1;
    //cin>>TC;
    while(TC--){
        cin>>n>>m;
        for(int i=0;i<m;i++){
            ll x,y;
            cin>>x>>y;
            mat[x][y]=mat[y][x]=1;
            adj[x].pb(y),adj[y].pb(x);
        }  
        for(int i=0;i<n;i++){
        if(!vis[i])
        dfs(0);
        }
        for(int k=0;k<n;k++){
            for(int i=0;i<n;i++){
                ll cnt=0;
                for(int j=0;j<n;j++){
                    if(j==i)
                    continue;
                    if(c[j]!=c[i]&&mat[j][i])
                    cnt++;
                }
                if(cnt<(adj[i].size()+1)/2){
                    c[i]=(c[i]^1);
                }
            }
        }
        for(int i=0;i<n;i++){
            if(c[i]==0)
            cout<<'P';
            else
            cout<<'S';
        }
        cout<<'\n';
    }
}