#include <bits/stdc++.h>

using namespace std;
#define int long long

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), in(n + 1), out(n + 1);
    for (int i = 1; i <= 2 * n; i++) {
        std::cin >> a[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 || out[q1.back()] > out[x]) {
                q1.push_back(x);
                ans[x] = 1;
            } else if (q2.size() == 0 || out[q2.back()] > out[x]) {
                q2.push_back(x);
                ans[x] = 2;
            } else {
                std::cout << "*\n";
                return 0;
            }
        } else {
            x = -x;
            if (q1.size() && q1.back() == x) {
                q1.pop_back();
            } else if (q2.size() && q2.back() == x) {
                q2.pop_back();
            } else {
                std::cout << "*\n";
                return 0;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        std::cout << "GS"[ans[i] - 1];
    }
    std::cout << "\n";
}