#include<bits/stdc++.h>

using namespace std;

const long long INF = 1e5 + 10, MOD = 1e9 + 7, MOD2 = 999999937;
const long long MAXN = 1e6;
int n;
map<string, int> mp;

class Solution
{
public:
    string s;
    void solve()
    {
        cin >> s;

        for(int mask = 0 ; mask < (1 << s.size()) ; mask++)
        {
            string s0 = "";
            for(int i = 0 ; i < s.size() ; i++)
            {
                if(mask & (1 << i) && s[i] == 'S' && s[i + 1] == 'S')
                {
                    s0 += 'B';
                    i++;
                    continue;
                }
                s0 += (char)(s[i] + 32);
            }
            mp[s0]++;
        }

        for(auto x : mp)
        {
            cout << x.first << "\n";
        }
        
        return;
    }
};

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    Solution().solve();

    return 0;
}