#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <typename T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <typename T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
void CHECKTIME(std::function<void()> f) {
  auto start = std::chrono::system_clock::now();
  f();
  auto end = std::chrono::system_clock::now();
  auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))
                 .count();
  std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n";
}
template <class T>
std::vector<std::vector<T>> VV(int n) {
  return std::vector<std::vector<T>>(n);
}
template <class T>
std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
  return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<ll, ll>;
using PAIRLL = std::pair<ll, ll>;
constexpr ll INFINT = 1 << 30;
constexpr ll INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-9;
constexpr ll MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
void norm(std::valarray<ll>& a) {
  if (a.size() == 1) {
    a[0] *= a[0];
    return;
  }
  ll p = a.size() - 1;
  while (p >= 0 && a[p] == 0) --p;
  if (p == -1) {
    a.resize(1, 0);
    return;
  }
  ++p;
  std::valarray<ll> res(p);
  for (ll i = 0; i < ll(p); ++i) {
    res[i] = a[i];
  }
  res *= res[p - 1];
  a = res;
  return;
}
std::valarray<ll> calc(std::valarray<ll> l, std::valarray<ll> r) {
  norm(l);
  norm(r);
  {
    std::cout << "CALL : (";
    ;
    for (ll i = 0; i < ll(l.size()); ++i) {
      std::cout << l[i];
      std::cout << " ";
      ;
    }
    std::cout << ")";
    std::cout << "\t";
    ;
    std::cout << "(";
    ;
    for (ll i = 0; i < ll(r.size()); ++i) {
      std::cout << r[i];
      std::cout << " ";
      ;
    }
    std::cout << ")";
    std::cout << "\n";
    ;
  }
  if (r.size() == 1 && r[0] == 0) return l;
  while (l.size() >= r.size()) {
    ll dif = l.size() - r.size();
    std::valarray<ll> a(l.size());
    for (ll i = 0; i < ll(r.size()); ++i) {
      a[i + dif] = r[i];
    }
    l -= a;
    norm(l);
    if (l.size() == 1 && l[0] == 0) break;
  }
  return calc(r, l);
}
std::valarray<ll> makeNext(std::valarray<ll> l, std::valarray<ll> r) {
  ll n = l.size();
  std::valarray<ll> res(n + 2);
  for (ll i = 0; i < ll(n); ++i) res[i] += l[i];
  for (ll i = 0; i < ll(n + 1); ++i) res[i + 1] += r[i];
  for (ll i = 0; i < ll(n + 2); ++i) res[i] %= 2;
  return res;
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  ll n;
  MACRO_VAR_Scan(n);
  ;
  std::valarray<ll> a1({1}), a2({0, 1});
  for (ll i = (2); i < (n + 1); ++i) {
    auto ne = makeNext(a1, a2);
    a1 = a2;
    a2 = ne;
  }
  std::cout << n;
  std::cout << "\n";
  ;
  for (ll i = 0; i < ll(n + 1); ++i) {
    std::cout << a2[i];
    std::cout << (i + 1 == n + 1 ? '\n' : ' ');
    ;
  }
  std::cout << n - 1;
  std::cout << "\n";
  ;
  for (ll i = 0; i < ll(n); ++i) {
    std::cout << a1[i];
    std::cout << (i + 1 == n ? '\n' : ' ');
    ;
  }
  return 0;
}
