#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
int n,st[1010],ed[1010],co[1010];
bool lk[1010][1010];
bool intersect(int x1,int y1,int x2,int y2)
{
    if(x1>x2)swap(x1,x2),swap(y1,y2);
    return x2<y1&&y1<y2;
}
void dfs(int p,int c)
{
    if(co[p]!=-1&&co[p]!=c){puts("*");exit(0);}
    if(co[p]!=-1)return;
    co[p]=c;
    rep(i,n)if(lk[p][i])dfs(i,!c);
}
int main()
{
    scanf("%d",&n);
    rep(i,2*n)
    {
        int x;scanf("%d",&x);
        if(x>0)st[x]=i;else ed[-x]=i;
    }
    rep(i,n)rep(j,i-1)if(intersect(st[i],ed[i],st[j],ed[j]))lk[i][j]=lk[j][i]=1;
    rep(i,n)co[i]=-1;
    rep(i,n)if(co[i]==-1)dfs(i,0);
    rep(i,n)printf("%c",co[i]?'S':'G');puts("");
    return 0;
}