/*If we keep holding onto yesterday, what are we going to be tomorrow?*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
bool debugg = false;
#define dbg if (debugg)
#define F first
#define S second
template <typename T>
using order_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;



bool valid (string &s)
{
    if (s[0]!='R') return 0;
    int cnt=0; int g=0;
    for (int i=0; i<s.size(); i++)
    {
        if (s[i]>'9') cnt++;
        if (s[i]=='G') g=i;

    }
    if (g>1 && cnt==2) return 1;
}


int32_t main()
{
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    int t;
    cin >> t;
    int T = 0;
    while (T++ < t)
    {
        string s;
        cin >> s;
        cout <<"Case " <<T <<": ";
        if (valid(s))
        {
            string ans1, ans2;
            bool spc = 0;
            for (int i = 1; i < s.size(); i++)
            {

                if (s[i] == 'G')
                    spc = 1;
                else if (spc)
                    ans1 += s[i];
                else
                    ans2 += s[i];
            }
            cout << ans1 << " " << ans2 << "n";
        }
        else
        {
            for (int i = 0; i < s.size(); i++)
            {
                cout << s[i];
                if (i < s.size() - 1 && s[i] > '9' && s[i + 1] <= '9')
                    cout << " ";
            }
            cout << "n";
        }
    }
}