#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define int128 __int128_t
#define pii128 pair<int128,int128>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-10;
const db pi = acos(-1);
template<class T> bool chmin(T& x, T y){
    if(x > y) {
        x = y;
        return true;
    } else return false;
}
template<class T> bool chmax(T& x, T y){
    if(x < y) {
        x = y;
        return true;
    } else return false;
}

// overload macro
#define CAT( A, B ) A ## B
#define SELECT( NAME, NUM ) CAT( NAME, NUM )

#define GET_COUNT( _1, _2, _3, _4, _5, _6 /* ad nauseam */, COUNT, ... ) COUNT
#define VA_SIZE( ... ) GET_COUNT( __VA_ARGS__, 6, 5, 4, 3, 2, 1 )

#define VA_SELECT( NAME, ... ) SELECT( NAME, VA_SIZE(__VA_ARGS__) )(__VA_ARGS__)

// rep(overload)
#define rep( ... ) VA_SELECT(rep, __VA_ARGS__)
#define rep2(i, n) for (int i = 0; i < int(n); i++)
#define rep3(i, a, b) for (int i = a; i < int(b); i++)
#define rep4(i, a, b, c) for (int i = a; i < int(b); i += c)

// repll(overload)
#define repll( ... ) VA_SELECT(repll, __VA_ARGS__)
#define repll2(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repll3(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define repll4(i, a, b, c) for (ll i = a; i < (ll)(b); i += c)

// rrep(overload)
#define rrep( ... ) VA_SELECT(rrep, __VA_ARGS__)    
#define rrep2(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep3(i, a, b) for (int i = b - 1; i >= a; i--)
#define rrep4(i, a, b, c) for (int i = b - 1; i >= a; i -= c)

// rrepll(overload)
#define rrepll( ... ) VA_SELECT(rrepll, __VA_ARGS__)
#define rrepll2(i, n) for (ll i = (ll)(n) - 1; i >= 0ll; i--)
#define rrepll3(i, a, b) for (ll i = b - 1; i >= (ll)(a); i--)
#define rrepll4(i, a, b, c) for (ll i = b - 1; i >= (ll)(a); i -= c)

// for_earh
#define fore(e, v) for (auto&& e : v)

// vector
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

int N, in[1010], out[1010];
char ans[1010];
string GS = "GS";
int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cin >> N;
    rep (i, 2 * N) {
        char c;
        int x;
        cin >> c >> x;
        x--;
        if (c == '+') in[x] = i;
        else out[x] = i;
    }

    vector<int> idx(N);
    rep (i, N) idx[i] = i;
    sort(all(idx), [&](int x, int y) {
        return in[x] < in[y];
    });

    stack<int> s[2];
    bool flag = true;
    rep (i, N) {
        rep (j, 2) while (!s[j].empty() && out[s[j].top()] < in[idx[i]]) s[j].pop();
        if (s[0].empty() && s[1].empty()) {
            ans[idx[i]] = 'G';
            s[0].push(idx[i]);
        } else if (s[0].empty() || s[1].empty()) {
            int x = 0, y = 1;
            if (!s[x].empty()) swap(x, y);
            if (out[s[y].top()] > out[idx[i]]) {
                s[y].push(idx[i]);
                ans[idx[i]] = GS[y];
            } else {
                s[x].push(idx[i]);
                ans[idx[i]] = GS[x];
            }
        } else {
            int x = 0, y = 1;
            if (out[s[x].top()] > out[s[y].top()]) swap(x, y);
            if (out[idx[i]] < out[s[x].top()]) {
                s[x].push(idx[i]);
                ans[idx[i]] = GS[x];
            } else if (out[idx[i]] < out[s[y].top()]) {
                s[y].push(idx[i]);
                ans[idx[i]] = GS[y];
            } else {
                flag = false;
            }
        }
    }

    if (flag) {
        rep (i, N) {
            cout << ans[i];
        }
        cout << '\n';
    } else {
        cout << "*\n";
    }
}