#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
void print() { cout << '\n'; }
template <typename T, typename...Args>
void print(T t, Args...args) { cout << t << ' '; print(args...); }
using ll = long long;
const int N = 1e6 + 1, inf = 1e9;

int dir[4][2] = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1}
};

template <typename T> bool chmax(T &x, T y) { if (y > x) { x = y; return true; } return false; }
template <typename T> bool chmin(T &x, T y) { if (y < x) { x = y; return true; } return false; }

template <typename T = int>
vector<T> readVector(int n) {
    vector<T> a(n);
    for(T &x: a) cin >> x;
    return a;
} 

int fa[N], v[N];

int find (int x) {
    if (x == fa[x]) {
        return x;
    }
    int root = fa[x];
    v[x] ^= v[fa[x]];
    return fa[x] = root;
}

bool merge (int x, int y) {
    int fx = find(x);
    int fy = find(y);
    if (fx == fy) {
        return v[x] ^ v[y];
    }
    v[fy] = v[x] ^ v[y] ^ 1;
    fa[fy] = fx;
    return true;
}

void solve () {
    int n;
    cin >> n;
    
    for (int i = 0; i < n; i ++) {
        fa[i] = i;
    }
    
    vector<int> l(n), r(n);
    
    for (int i = 0; i < 2 * n; i ++) {
        char c;
        int x;
        cin >> c >> x;
        x --;
        if (c == '+') {
            l[x] = i;
        } else {
            r[x] = i;
        }
    }
    
    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            if (l[i] < l[j] && l[j] < r[i] && r[j] > r[i] && !merge(i, j)) {
                cout << '*';
                return;
            }
        }
    }
    for (int i = 0; i < n; i ++) {
        int j = find(i);
        cout << (v[i] == 0 ? 'G' : 'S');
    }
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1; 
	//cin >> t;
	while(t --) {
	    solve();
	}

	return 0;
}