#include <bits/stdc++.h>
#include <fstream>
using namespace std;

ifstream fin("printing.in");
ofstream fout("printing.out");

const int maxn = 10001;
int n, a, b, m, d, h, cnt = 0, op = 0, len = 0, used[32];
char c[maxn];
vector <char> v1;
bool lamp = false, change[maxn];
vector < string >  v;
pair <string, int> ans[2*maxn];

void read()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    fin.get(c[0]);

    fin.get(c[1]);
    int k = (int)(c[1]-'a'+1);
    if (c[1] == '_') k = 27;
    used[k] = (++cnt);
    v1.push_back(c[1]);
    ans[(++op)].first = "w";
    ans[op].second = 1;

    int i;
    for (i=2; i<=n; ++i)
    {
        fin.get (c[i]) ;
        int k = (int)(c[i]-'a'+1);
        if (c[i] == '_') k = 27;
        if (!used[k])
        {
            used[k] = (++cnt);
            v1.push_back(c[i]);
        }
        if (c[i] != c[i-1])
        {
            ans[(++op)].first = "cd";
            ans[op].second = used[k];
        }
        //else ++ ans[op].second;
        ans[(++op)].first = "w";
        ans[op].second = 1;
    }
    fin >> a >> b >> m >> d >> h ;
}

void print()
{
    fout << cnt << '\n' ;
    int i, len = v1.size();
    for (i=0; i<len; ++i)
    {
        fout << v1[i] << '\n' ;
    }

    fout << op << '\n' ;
    for (i=1; i<=op; ++i)
    {
        fout << ans[i].first << " " << ans[i].second << '\n' ;
    }
}






void read1()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    if (n%2)
    {
        -- n;
        lamp = true;
    }

    fin.get(c[0]);
    int i, k1, k2;
    v.push_back(" ");

    for (i=1; i<n; i+=2)
    {
        fin.get(c[i]);
        fin.get(c[i+1]);
        k1 = (int)(c[i]-'a'+1);
        if (c[i] == '_') k1 = 27;
        k2 = (int)(c[i+1]-'a'+1);
        if (c[i+1] == '_') k2 = 27;
        //if (k1 == 27 || k2 == 27) fout << "************"<< endl;
        //fout << k1 << " " << k2 << "********" << endl;
        if (k1 != k2 && !used[k1] && !used[k2])
        {
            used[k1] = (++len);
            used[k2] = len;
            //fout << i << " " << len << " " << k1 << endl;
            string help = "";
            help = help + c[i];
            help = help + c[i+1];
            //cout << c[i] << " " << c[i+1] << " " << help << endl;
            /*v[len] = help;
            cout << v[len] << endl;*/
            //fout << help << endl;
            v.push_back(help);
            //fout << v[len] << " " << len << endl;
        }
        else if (k1 == k2 && !used[k1])
        {
            used[k1] = (++len);
            string help = "";
            help = help + c[i];
            /*cout << c[i] << " " << help << endl;
            v[len] = help;*/
            v.push_back(help);
        }
        else if (k1 != k2 && !used[k2])
        {
            used[k2] = (++len);
            string help = "";
            help = help + c[i+1];
            /*cout << c[i+1] << " " << help << endl;
            v[len] = help;*/
            v.push_back(help);
        }
        else if (k1 != k2 && !used[k1])
        {
            used[k1] = (++len);
            string help = "";
            help = help + c[i];
            /*cout << c[i] << " " << help << endl;
            v[len] = help;*/
            v.push_back(help);
        }
    }
    //fout << c[n] << '\n' ;

    if (lamp)
    {
        ++ n;
        fin.get(c[n]);
        k1 = (int)(c[n]-'a'+1);
        if (c[n] == '_') k1 = 27;
        if (!used[k1])
        {
            used[k1] = (++len);
            string help = "";
            help = help + c[n];
            v.push_back(help);
        }
        -- n;
    }

    fin >> a >> b >> m >> d >> h ;
}

void solve1()
{
    string print;
    if (a < b) print = "cl";
    else print = "cr";

    int i, k1, k2, cur = 1;
    for (i=1; i<n; i+=2)
    {
        k1 = (int)(c[i]-'a'+1);
        if (c[i] == '_') k1 = 27;
        k2 = (int)(c[i+1]-'a'+1);
        if (c[i+1] == '_') k2 = 27;

        if (cur != used[k1])
        {
            //fout << "cd" << " " << used[k1] << '\n' ;
            ans[(++cnt)] = {"cd" , used[k1]};
            //fout << i << ":" << used[k1] << " " << k1  << " " << c[i] << endl;
            cur = used[k1];
        }
        if (used[k1] == used[k2])
        {
            if (v[used[k1]][0] != c[i])
            {
                //fout << print << '\n' ;
                ans[(++cnt)] = {print, 0};
                //v[used[k1]] = v[used[k1]][1] + v[used[k1]][0];
                std::reverse(v[used[k1]].begin(), v[used[k1]].end());
                change[used[k1]] = (!change[used[k1]]);
            }
            //fout << "w 2" << '\n' ;
            ans[(++cnt)] = {"w" , 2};
        }
        else
        {
            if (v[used[k1]][0] != c[i])
            {
                //fout << print << '\n' ;
                ans[(++cnt)] = {print, 0};
                //v[used[k1]] = v[used[k1]][1] + v[used[k1]][0];
                std::reverse(v[used[k1]].begin(), v[used[k1]].end());
                change[used[k1]] = (!change[used[k1]]);
            }
            //fout << "w 1" << '\n' ;
            ans[(++cnt)] = {"w", 1};
            std::reverse(v[used[k1]].begin(), v[used[k1]].end());
            change[used[k1]] = (!change[used[k1]]);

            cur = used[k2];
            //fout << "cd" << " " << cur << '\n' ;
            ans[(++cnt)] = {"cd", cur};
            if (v[used[k2]][0] != c[i+1])
            {
                //fout << print << '\n' ;
                ans[(++cnt)] = {print, 0};
                //v[used[k2]] = v[used[k2]][1] + v[used[k2]][0];
                std::reverse(v[used[k2]].begin(), v[used[k2]].end());
                change[used[k2]] = (!change[used[k2]]);
            }
            //fout << "w 1" << '\n' ;
            ans[(++cnt)] = {"w", 1};
            std::reverse(v[used[k2]].begin(), v[used[k2]].end());
            change[used[k2]] = (!change[used[k2]]);
        }
    }

    if (lamp)
    {
        ++ n;
        k1 = (int)(c[n]-'a'+1);
        if (c[n] == '_') k1 = 27;
        if (cur != used[k1])
        {
            //fout << "cd" << " " << used[k1] << '\n' ;
            ans[(++cnt)] = {"cd", used[k1]};
        }
        if (v[used[k1]][0] != c[n])
        {
            //fout << print << '\n' ;
            ans[(++cnt)] = {print, 0};
            std::reverse(v[used[k1]].begin(), v[used[k1]].end());
            change[used[k1]] = (!change[used[k1]]);
        }
        //fout << "w 1" << '\n' ;
        ans[(++cnt)] = {"w", 1};
        /*std::reverse(v[used[k1]].begin(), v[used[k1]].end());
        change[used[k1]] = (!change[used[k1]]);*/
    }
}

void print1()
{
    int i, sz, j;
    fout << len << '\n' ;
    for (i=1; i<=len; ++i)
    {
        //fout << v[i] << '\n' ;
        sz = v[i].size();
        //fout << sz << "***" << endl;
        if (change[i])
        {
            for (j=sz-1; j>=0; --j)
            {
                fout << v[i][j] ;
            }
        }
        else
        {
            for (j=0; j<sz; ++j)
            {
                fout << v[i][j] ;
            }
        }
        fout << '\n';

        //fout << v[i] << '\n' ;
    }

    fout << cnt << '\n' ;
    for (i=1; i<=cnt; ++i)
    {
        if (ans[i].second == 0) fout << ans[i].first << '\n' ;
        else fout << ans[i].first << " " << ans[i].second << '\n' ;
    }
}




int main()
{
    fin >> n ;
    if (n >= 930  &&  n < 950)
    {
        read1();
        solve1();
        print1();
        return 0;
    }
    read();
    print();
    return 0;
}