#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);
    std::stack<int> q1, q2;
    map<int, int> mp, is;
    std::vector<int> ans(n + 1);
    for (int i = 1; i <= 2 * n; i++) {
        std::cin >> a[i];
    }
    for (int i = 1; i <= 2 * n; i++) {
        if(a[i] > 0) {
            q1.push(a[i]);
            is[a[i]] = 1;
        } else {
            a[i] *= -1;
            is[i] = 0;
            if(!is[a[i]]) {
                cout << "*\n";
                return 0;
            }
            if(!mp.count(a[i])) {
                int x = 0;
                stack<int> s;
                while(q1.size()) {
                    x = q1.top(); q1.pop();
                    if(x != a[i]) {
                        s.push(x);
                        mp[x] = 1;
                    } else {
                        break;
                    }
                }
                while(s.size()) {
                    x = s.top();
                    s.pop();
                    q2.push(x);
                }
            } else {
                if(q2.top() == a[i]) {
                    q2.pop();
                    ans[a[i]] = 1;
                } else {
                    cout << "*\n";
                    return 0;
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        std::cout << "GS"[ans[i]];
    }
    std::cout << "\n";
    return 0;
}