#include <iostream>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <string.h>
#include <iomanip>
#include <unordered_set>

#define ll long long

using namespace std;

const int N = 300;
const ll mod = 1e9 + 7;
const ll INF = 1e18;

int n;
string s;

string lowerCase(string s)
{
	for (int i = 0; i < n; i++)
	{
		s[i] += ('a' - 'A');
	}
	return s;
}

void solve()
{
	string lowS = lowerCase(s);
	cout << lowS << '\n';
	for (int i = 0; i < n - 1; i++)
	{
		if (s[i] == 'S' && s[i + 1] == 'S')
		{
			cout << lowS.substr(0, i) + 'B' + lowS.substr(i + 2, n - i - 2) << '\n';
		}
	}
}

signed main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
	if (fopen("data.inp", "r")) 	
	{
		freopen ("data.inp", "r", stdin);
		freopen ("data.out", "w", stdout);
	}
	cin >> s;
	n = s.length();
	solve();
    return 0;
}