/// Brrrr Brrrr
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
//#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 2e5+5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

const int dx[] = {1,-1,1,-1};
const int dy[] = {1,-1,-1,1};


void doWork() {

    vector<int> vals;
    string s;
    cin >> s;
    vals.push_back(1);
    for(int i = 1; i < s.size(); i++) {
        if(s[i] != s[i-1])vals.push_back(0);
        vals.back() += 1;
    }
    vector<string> ans;
    if(s[0] == 'a')
        ans.push_back("swap");

    if(vals.size() == 1) {
        cout << s.size() * 2 - 2 + (s[0] == 'a') << '\n';
        if(s[0] == 'a')cout << "swap\n";
        f(i,0,s.size()-1) cout << "copy\n";
        f(i,0,s.size()-1) cout << "fuse\n";
        return;
    }


    for(int i = 0; i < vals.size(); i++) {
        int x = vals[i];
        if(i + 2 == vals.size()) {
            ///5ra have want
            f(i,0,x-1) ans.push_back("copy");
            f(i,0,x-1) ans.push_back("fuse");
            ///5ra want 5ra
            ans.push_back("swap");
        }   else if(i + 1 == vals.size()) {
            f(i,0,x-1) ans.push_back("copy");
            f(i,0,x-1) ans.push_back("fuse");
        }   else {
            if(x == 1) {
                ///5ra want 5ra have
                ans.push_back("copy");
                ans.push_back("roll");
            }   else {
                f(i,0,x)
                    ans.push_back("copy"); ///x
                f(i,0,x - 1)
                    ans.push_back("fuse"); ///x-1
                ///5ra want have 5ra
                ans.push_back("swap");
                ///5ra 5ra have want
                ans.push_back("roll");
            }
        }
    }

    for(int i = 1; i < vals.size(); i++) {
        ans.push_back("fuse");
    }


    cout << ans.size() << endl;
    for(auto x : ans) {
        cout << x << '\n';
    }



}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}

///Look at my code ya codeomk