#include <bits/stdc++.h>
#define ull unsigned long long
#define pb push_back

using namespace std;

void reversed(ull &n)
{
    ull temp = 0;

    for(int i=0; i<8; i++)
    {
        temp += ((n >> (8*i)) & 255) << (56 - 8 *i);
    }

    n = temp;
}

int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

    string s;
    cin >> s;

    if(s == "encode")
    {
        int n;
        cin >> n;

        vector<ull> a(n);
        for(int i=0; i<n; i++) cin >> a[i];

        vector<ull> b((n+47)/48, 1);
        for(int i=0; i<n; i++)
        {
            int l = 0, r = 7;
            while(l<r)
            {
                if( ((a[i] >> (8*r)) & 255) == ((a[i] >> (8*l)) & 255) )
                {
                    l++;
                    r--;
                    continue;
                }
                else if( ((a[i] >> (8*r)) & 255) < ((a[i] >> (8*l)) & 255) )
                {
                    b[i/48] += ((ull) 1 << (i%48 + 8));
                }

                break;
            }
        }

        cout << 1 + a.size() + b.size() << "\n";
        cout << n << " ";
        for(ull x: a) cout << x << " ";
        for(ull x: b) cout << x << " ";
        cout << "\n";
    }
    else
    {
        int x;
        cin >> x;

        vector<ull> d(x);
        for(int i=0; i<x; i++) cin >> d[i];

        if(d[0] > 1000) reversed(d[0]);

        for(int i = 1 + d[0]; i<x; i++)
        {
            if(d[i]%2 == 0) reversed(d[i]);

            for(int j=0; j<48; j++)
            {
                int k = 48 * (i - 1 -d[0]) + j + 1;
                if(k >= 1 + d[0]) break;

                if((d[i] >> (j + 8)) & 1)
                {
                    int l = 0, r = 7;
                    while(l<r)
                    {
                        if( ((d[k] >> (8*r)) & 255) == ((d[k] >> (8*l)) & 255) )
                        {
                            l++;
                            r--;
                            continue;
                        }
                        else if( ((d[k] >> (8*r)) & 255) > ((d[k] >> (8*l)) & 255) )
                        {
                            reversed(d[k]);
                        }

                        break;
                    }
                }
                else
                {
                    int l = 0, r = 7;
                    while(l<r)
                    {
                        if( ((d[k] >> (8*r)) & 255) == ((d[k] >> (8*l)) & 255) )
                        {
                            l++;
                            r--;
                            continue;
                        }
                        else if( ((d[k] >> (8*r)) & 255) < ((d[k] >> (8*l)) & 255) )
                        {
                            reversed(d[k]);
                        }

                        break;
                    }
                }
            }
        }

        for(int i=1; i<1+d[0]; i++) cout << d[i] << " ";
        cout << "\n";
    }
}