#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];
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) v.push_back(x);
        else
        {
            if (v.back() == -x) v.pop_back();
            else
            {
                int xx = -x;
                for (int j=v.size()-1; j>=0; j--) if (v[j] == xx) break;
                else
                {
                    adj[v[j]].push_back(xx);
                    adj[xx].push_back(v[j]);
                }
            }
        }
    }
    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');
}