#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int MAX_A_LEN = 1000;
constexpr int D = (MAX_A_LEN * 64 + 63 - 1) / 63 - MAX_A_LEN;

/*
  unordered pair of u32
    0123
  0 0123
  1 4567
  2   x4
  3    x
  
  a[0]...a[7] ... a[24]...a[31] b[24]...b[31] ... b[0]...b[7]
*/
unsigned long long enc(unsigned long long x) {
  assert(!(x >> 63));
  unsigned a = x >> 32, b = x;
  if (a > b) {
    a = ~a;
    b = ~b;
  }
  unsigned long long y = a;
  for (int e = 0; e < 32; ++e) {
    y |= (unsigned long long)(b >> e & 1) << ((7 - (e/8)) * 8 + (e%8));
  }
  return y;
}
unsigned long long dec(unsigned long long y) {
  unsigned a = y, b = 0;
  for (int e = 0; e < 32; ++e) {
    b |= (y >> ((7 - (e/8)) * 8 + (e%8)) & 1) << e;
  }
  if (a > b) {
    swap(a, b);
  }
  if (a >> 31) {
    a = ~a;
    b = ~b;
  }
  return (unsigned long long)a << 32 | b;
}

void encode() {
  int ALen;
  scanf("%d", &ALen);
  vector<unsigned long long> A(ALen);
  for (int i = 0; i < ALen; ++i) {
    scanf("%llu", &A[i]);
  }
  
  auto at = [&](int pos) -> unsigned long long {
    const int i = pos >> 6;
    return (0 <= i && i < ALen) ? (A[i] >> (pos & 63) & 1) : 0;
  };
  const int BLen = ALen + D;
  vector<unsigned long long> B(BLen, 0);
  for (int j = 0; j < (ALen * 64 + 63 - 1) / 63; ++j) {
    unsigned long long x = 0;
    for (int e = 0; e < 63; ++e) {
      x |= at(j * 63 + e) << e;
    }
    B[j] = enc(x);
  }
  
  printf("%d\n", BLen);
  for (int j = 0; j < BLen; ++j) {
    if (j) printf(" ");
    printf("%llu", B[j]);
  }
  puts("");
}

void decode() {
  int BLen;
  scanf("%d", &BLen);
  vector<unsigned long long> B(BLen);
  for (int j = 0; j < BLen; ++j) {
    scanf("%llu", &B[j]);
  }
  
  const int ALen = BLen - D;
  vector<unsigned long long> A(ALen, 0);
  auto se = [&](int pos, unsigned long long val) -> void {
    const int i = pos >> 6;
    if (0 <= i && i < ALen) {
      A[i] |= val << (pos & 63);
    }
  };
  for (int j = 0; j < (ALen * 64 + 63 - 1) / 63; ++j) {
    const unsigned long long y = dec(B[j]);
    for (int e = 0; e < 63; ++e) {
      se(j * 63 + e, y >> e & 1);
    }
  }
  
  for (int i = 0; i < ALen; ++i) {
    if (i) printf(" ");
    printf("%llu", A[i]);
  }
  puts("");
}

int main() {
  char typ[110];
  for (; ~scanf("%s", typ); ) {
    if (!strcmp(typ, "encode")) {
      encode();
    } else if (!strcmp(typ, "decode")) {
      decode();
    } else {
      assert(false);
    }
  }
  return 0;
}