#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    vector<int> pos(n, -1), rgh(n);
    vector<int> arr(2 * n);
    for (int i = 0; i < 2 * n; ++i) {
        cin >> arr[i];
        if (arr[i] > 0) {
            pos[arr[i] - 1] = i;
        } else {
            if (pos[-arr[i] - 1] == -1) {
                cout << "*\n";
                return 0;
            }
            rgh[-arr[i] - 1] = i;
        }
    }

    vector<int> st1, st2;
    st1.push_back(2 * n);
    st2.push_back(2 * n);
    string ans(n, '-');
    string s = "GS";
    for (int i = 0; i < 2 * n; ++i) {
        int val = abs(arr[i]) - 1;
        if (arr[i] > 0) {
            if (rgh[val] < st1.back()) {
                st1.push_back(rgh[val]);
                ans[val] = s[0];
            } else if (rgh[val] < st2.back()) {
                st2.push_back(rgh[val]);
                ans[val] = s[1];
            } else {
                cout << "*\n";
                return 0;
            }
        } else {
            if (st1.back() == i) {
                st1.pop_back();
            } else {
                st2.pop_back();
            }
        }
        if (st1.back() > st2.back()) {
            swap(st1, st2);
            swap(s[0], s[1]);
        }
    }

    cout << ans << "\n";
    
    return 0;
}