#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 <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; }



int main() {
  char typ[110];
  scanf("%s", typ);
  if (!strcmp(typ, "Alice")) {
    int N;
    scanf("%d", &N);
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    
    int X = 0;
    for (int i = 0; i < N; ++i) {
      X |= 1 << A[i];
    }
    printf("%d\n", X);
  } else if (!strcmp(typ, "Bob")) {
    int X;
    scanf("%d", &X);
    
    vector<int> A;
    for (int a = 0; a < 20; ++a) if (X >> a & 1) {
      A.push_back(a);
    }
    const int N = A.size();
    printf("%d\n", N);
    for (int i = 0; i < N; ++i) {
      if (i) printf(" ");
      printf("%d", A[i]);
    }
    puts("");
  } else {
    assert(false);
  }
  return 0;
}