#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1005;

template <typename T> inline void read(T &WOW) {
    T x = 0, flag = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-') flag = -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    WOW = flag * x;
}

int n, L[N], R[N], g[N][N], col[N];

bool Check(int s) {
    queue<int> q;
    col[s] = 1;
    q.push(s);
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int v = 1; v <= n; ++v) {
            if (u == v || g[u][v]) continue;
            if (col[v]) {
                if (col[u] == col[v]) {
                    return 0;
                }
            } else {
                col[v] = 3 - col[u];
                q.push(v);
            }
        }
    }
    return 1;
}

void solve() {
    read(n);
    for (int i = 1; i <= n * 2; ++i) {
        int x; read(x);
        if (x > 0) L[x] = i;
        else R[-x] = i;
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (i == j) continue;
            if (L[i] < L[j] && R[j] < R[i]) {
                g[i][j] = g[j][i] = 1;
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (!col[i]) {
            if (!Check(i)) {
                puts("*");
                return;
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        putchar(col[i] == 1? 'G' : 'S');
    }
    puts("");
}

int main() {
    solve();
    return 0;
}