#include <bits/stdc++.h>
using namespace std;
const int MAXN = 55;
int n;
long long tr[MAXN];
int top = 0;
int a[MAXN];
int mar[MAXN][MAXN][MAXN];
bool Same(long long p) {
  int tmp[2][MAXN][MAXN];
  memset(tmp, 0, sizeof(tmp));
  int now = 0;
  for (int i = 1; i <= n; i++) tmp[now][i][i] = 1;
  for (int d = 0; d <= n; d++)
    if ((1ll << d) & p) {
      now = 1 - now;
      for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) tmp[now][i][j] = 0;
      for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
          for (int k = 1; k <= n; k++)
            tmp[now][i][k] =
                (tmp[now][i][k] + tmp[1 - now][i][j] * mar[d][j][k]) & 1;
    }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (tmp[now][i][j] != mar[0][i][j]) return false;
  return true;
}
bool chk() {
  memset(mar, 0, sizeof(mar));
  for (int i = 1; i < n; i++) mar[0][i + 1][i] = 1;
  for (int i = 1; i <= n; i++) mar[0][i][n] = a[i];
  for (int d = 1; d <= n; d++) {
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= n; j++)
        for (int k = 1; k <= n; k++)
          mar[d][i][j] =
              (mar[d][i][j] + mar[d - 1][i][k] * mar[d - 1][k][j]) & 1;
  }
  long long k = 1;
  for (int i = 1; i <= n; i++) k <<= 1;
  if (!Same(k)) return false;
  for (int i = 1; i <= top; i++)
    if (Same(tr[i] + 1)) return false;
  return true;
}
int main() {
  scanf("%d", &n);
  long long k = 1;
  for (int i = 1; i <= n; i++) k <<= 1;
  k--;
  long long r = k;
  for (int i = 2; i * (long long)i <= r; i++) {
    if (r % i == 0) {
      while (r % i == 0) r /= i;
      tr[++top] = k / i;
    }
  }
  if (r != 1) tr[++top] = k / r;
  bool flag = false;
  while (!flag) {
    for (int i = 1; i <= n; i++) a[i] = rand() % 2;
    for (int i = 1; i <= n; i++)
      if (a[i] == 1) {
        if (chk()) {
          for (int i = n; i >= 1; i--) printf("%d ", a[i]);
          printf("\n");
          for (int i = 1; i <= n; i++) printf("1 ");
          printf("\n");
          flag = true;
        }
        break;
      }
  }
  return 0;
}
