#include <bits/stdc++.h>

using i64 = long long;
using namespace std;
const int inf=1e9,N=1005;
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
int n,in[N],out[N],vis[N],e[N][N];
bool ins(int x,int y){
    return in[x]<=in[y]&&out[x]<=out[y]&&in[y]<=out[x];
}
void dfs(int p,int x){
    if(vis[p]!=-1&&vis[p]!=x){
        cout<<"*\n"; exit(0);
    }
    if(vis[p]!=-1)return;
    vis[p]=x;
    For(i,1,n)if(e[i][p])dfs(i,x^1);
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cin>>n;
    For(i,1,n*2){
        char ch;
        cin>>ch;
        while(ch!='+'&&ch!='-')cin>>ch;
        int x;
        cin>>x;
        if(ch=='+')in[x]=i; else out[x]=i;
    }
    For(i,1,n)For(j,i+1,n)if(ins(i,j)||ins(j,i))e[i][j]=e[j][i]=1;
    //For(i,1,n)cout<<in[i]<<" "<<out[i]<<" "<<e[1][2]<<endl;
    memset(vis,-1,sizeof(vis));
    For(i,1,n)if(vis[i]==-1)dfs(i,0);
    For(i,1,n)if(vis[i])cout<<'S'; else cout<<'G';
    cout<<endl;
    return 0;
}