#include <bits/stdc++.h>

using namespace std;
#define int long long

#define pii pair<int, int>
string check(int n, vector<int> &a) {
    std::vector<int> in(n + 1), out(n + 1);
    for (int i = 1; i <= 2 * n; i++) {
        if (a[i] > 0) in[a[i]] = i;
        if (a[i] < 0) out[-a[i]] = i;
    }
    std::vector<int> q1, q2;
    std::vector<int> ans(n + 1);
    for (int i = 1; i <= 2 * n; i++) {
        int x = a[i];
        if (x > 0) {
            if (q1.size() && q2.size() && out[q1.back()] < out[q2.back()] && out[x] < out[q1.back()]) {
                q1.push_back(x);
                ans[x] = 1;
            } else if (q1.size() && q2.size() && out[q1.back()] > out[q2.back()] && out[x] < out[q2.back()]) {
                q2.push_back(x);
                ans[x] = 2;
            } else if (q1.size() && out[q1.back()] > out[x]) {
                q1.push_back(x);
                ans[x] = 1;
            } else if (q2.size() && out[q2.back()] > out[x]) {
                q2.push_back(x);
                ans[x] = 2;
            } else if (q1.size() == 0) {
                q1.push_back(x);
                ans[x] = 1;
            } else if (q2.size() == 0) {
                q2.push_back(x);
                ans[x] = 2;
            } else {
                return "*";
            }
        } else {
            x = -x;
            if (q1.size() && q1.back() == x) {
                q1.pop_back();
            } else if (q2.size() && q2.back() == x) {
                q2.pop_back();
            } else {
                return "*";
            }
        }
    }
    string t = "";
    for (int i = 1; i <= n; i++) {
        t += "GS"[ans[i] - 1];
    }
    return t;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    std::cin >> n;
    std::vector<int> a(2 * n + 1), q1(n + 1), q2(n + 1);
    map<int, int> mp, is;
    std::vector<int> ans(n + 1);
    priority_queue<pii> hp1, hp2;
    for (int i = 1; i <= 2 * n; i++) {
        std::cin >> a[i];
    }
    for (int i = 1; i <= 2 * n; i++) {
        if(a[i] > 0) {
            hp1.push({i, a[i]});
            is[a[i]] = 1;
        } else {
            int y = a[i] * -1;
            if(is[y] == 1) {
                while(hp1.size()) {
                    auto [id, x] = hp1.top();
                    hp1.pop();
                    if(x != y) {
                        hp2.push({id, x});
                        is[x] = 2;
                    } else {
                        ans[y] = 1;
                        break;
                    }
                }
            } else {
                if(hp2.top().second == y) {
                    hp2.pop();
                    ans[y] = 2;
                } else {
                    cout << check(n, a);
                    return 0;
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        std::cout << " GS"[ans[i]];
    }
    std::cout << "\n";
    return 0;
}