#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define f first
#define s second
#define lep(i,a,b) for (int i=(a); i <= (b); i++)
#define rep(i,b,a) for (int i = (b); i >= (a); i--)

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;
    vector<pi> edges;
    vector<int> l(n+1), r(n+1);
    lep(i,1,2*n) {
        int x;
        cin >> x;
        if (x > 0) l[x] = i;
        else r[-x] = i;
    }

    auto nest = [&](int l1, int r1, int l2, int r2) -> bool  {
        if (l1 > l2 and r1 < l2) return true;
        if (l1 < l2 and r1 > l2) return true;
        return false;
    };

    auto disj = [&](int l1, int r1, int l2, int r2) {
        if (l1 > r2 or r1 < l2) return true;
        return false;
    };

    lep(i,1,n) {
        lep(j,i+1,n) {
            if (!nest(l[i],r[i],l[j],r[j]) or !disj(l[i],r[i],l[j],r[j])) {
                edges.pb({i,j});
            }
        }
    }


    vector<vector<int>> adj(n+1);
    for (auto [u,v]: edges) {
        adj[u].pb(v);
        adj[v].pb(u);
    }
    vector<int> color(n+1);
    bool ok = true;

    auto dfs = [&](auto &self, int u, int p, int c) -> void {
        color[u] = c;
        for (int v: adj[u]) {
            if (color[v] == color[u]) ok = false;
            else if (!color[v]) {
                self(self,v,u,3-c);
            }
        }
    };
    lep(i,1,n) {
        if (!color[i]) {
            dfs(dfs,i,0,1);
        }
    }
    if (!ok) {
        cout << "*\n";
    } else {
        lep(i,1,n) {
            cout << ((color[i] == 1) ? 'G' : 'S');
        }
        cout << "\n";
    }
}