#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

const int M = 1010;

bool edge(int l1, int r1, int l2, int r2) {
    if (l2 < l1) {
        swap(l1, l2);
        swap(r1, r2);
    }
    return l2 < r1 && r2 > r1;
}

int n;
int l[M], r[M];
int seq[2 * M];
int col[M];

void dfs(int p, int c) {
    col[p] = c;
    for (int i = 0; i < n; i++) {
        if (i == p || !edge(l[i], r[i], l[p], r[p])) {
            continue;
        }
        if (col[i] == -1) {
            dfs(i, 1 - c);
        } else {
            if (col[i] == col[p]) {
                cout << "*\n";
                exit(0);
            }
        }
    }
}

void solve() {
    cin >> n;
    for (int i = 0; i < 2 * n; i++) {
        cin >> seq[i];
        if (seq[i] > 0) {
            l[seq[i] - 1] = i;
        } else {
            r[-seq[i] - 1] = i;
        }
    }
    for (int i = 0; i < n; i++) {
        col[i] = -1;
    }
    for (int i = 0; i < n; i++) {
        if (col[i] == -1) {
            dfs(i, 0);
        }
    }
    for (int i = 0; i < 2 * n; i++) {
        if (seq[i] < 0) {
            int p = -seq[i] - 1;
            cout << "GS"[col[p]];
        }
    }
    cout << "\n";
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}