#include <bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
#define ff first
#define ss second

const int maxn = 5010;
vector<int> adj[maxn];
ii pos[maxn];
int c[maxn], n;

bool DFS(int u, int val)
{
    c[u] = val;
    for (int v: adj[u]) 
        if (c[v] == -1) 
        {
            if (!DFS(v, val ^ 1)) return 0;
        }
        else
        {
            if (c[v] != val ^ 1) return 0;
        } 
    return 1;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }
    vector<int> v;
    cin>>n;
    for (int i=1; i<=n; i++) c[i] = -1;
    for (int i=1; i<=2*n; i++)
    {
        int x;
        cin>>x;
        if (x > 0) pos[x].ff = i;
        else pos[-x].ss = i;
    }
    for (int i=1; i<n; i++)
        for (int j=i+1; j<=n; j++)
            {
                if (pos[i].ss > pos[j].ff && pos[i].ss < pos[j].ss && pos[i].ff < pos[j].ff)
                    adj[i].push_back(j), adj[j].push_back(i);
                else if (pos[i].ff > pos[j].ff && pos[i].ff < pos[j].ss && pos[i].ss > pos[j].ss)
                    adj[i].push_back(j), adj[j].push_back(i);
            }
    for (int i=1; i<=n; i++) if (c[i] == -1 && !DFS(i, 0)) return cout<<"*", 0;
    for (int i=1; i<=n; i++) cout<<(c[i] ? 'G' : 'S');
}