Problem: Suppose you have two polynomials <image> and <image>. Then polynomial <image> can be uniquely represented in the following way:

<image>

This can be done using [long division](https://en.wikipedia.org/wiki/Polynomial_long_division). Here, <image> denotes the degree of polynomial P(x). <image> is called the remainder of division of polynomial <image> by polynomial <image>, it is also denoted as <image>. 

Since there is a way to divide polynomials with remainder, we can define Euclid's algorithm of finding the greatest common divisor of two polynomials. The algorithm takes two polynomials <image>. If the polynomial <image> is zero, the result is <image>, otherwise the result is the value the algorithm returns for pair <image>. On each step the degree of the second argument decreases, so the algorithm works in finite number of steps. But how large that number could be? You are to answer this question. 

You are given an integer n. You have to build two polynomials with degrees not greater than n, such that their coefficients are integers not exceeding 1 by their absolute value, the leading coefficients (ones with the greatest power of x) are equal to one, and the described Euclid's algorithm performs exactly n steps finding their greatest common divisor. Moreover, the degree of the first polynomial should be greater than the degree of the second. By a step of the algorithm we mean the transition from pair <image> to pair <image>. 

Input

You are given a single integer n (1 ≤ n ≤ 150) — the number of steps of the algorithm you need to reach.

Output

Print two polynomials in the following format.

In the first line print a single integer m (0 ≤ m ≤ n) — the degree of the polynomial. 

In the second line print m + 1 integers between  - 1 and 1 — the coefficients of the polynomial, from constant to leading. 

The degree of the first polynomial should be greater than the degree of the second polynomial, the leading coefficients should be equal to 1. Euclid's algorithm should perform exactly n steps when called using these polynomials.

If there is no answer for the given n, print -1.

If there are multiple answer, print any of them.

Examples

Input

1


Output

1
0 1
0
1


Input

2


Output

2
-1 0 1
1
0 1

Note

In the second example you can print polynomials x2 - 1 and x. The sequence of transitions is

(x2 - 1, x) → (x, - 1) → ( - 1, 0).

There are two steps in it.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct node {
  int p[200];
  void q() {
    for (int i = 151; i > 0; i--) p[i] = p[i - 1];
    p[0] = 0;
  }
  void f(int a[]) {
    for (int i = 0; i <= 150; i++) {
      p[i] += a[i];
    }
  }
  void g(int a[]) {
    for (int i = 0; i <= 150; i++) {
      p[i] -= 2 * a[i];
    }
  }
  bool vj() {
    bool flag = true;
    for (int i = 0; i <= 150; i++) {
      if (p[i] > 1 || p[i] < -1) {
        flag = false;
        break;
      }
    }
    return flag;
  }
};
int main() {
  int n;
  scanf("%d", &n);
  int m = n;
  int ans1[200][200];
  int ans2[200][200];
  node a, b;
  memset(a.p, 0, sizeof(a.p));
  memset(b.p, 0, sizeof(b.p));
  memset(ans2, 0, sizeof(ans2));
  a.p[0] = 1;
  memset(ans1, 0, sizeof(ans1));
  ans1[0][0] = 1;
  int tt = 1;
  while (m--) {
    int t[200];
    for (int i = 0; i < tt; i++) {
      t[i] = a.p[i];
    }
    a.q();
    a.f(b.p);
    if (!a.vj()) {
      a.g(b.p);
    }
    for (int i = 0; i <= tt; i++) {
      ans1[tt][i] = a.p[i];
      ans2[tt][i] = t[i];
      b.p[i] = t[i];
    }
    tt++;
  }
  printf("%d\n", n);
  for (int i = 0; i <= n; i++) printf("%d%c", ans1[n][i], i == n ? '\n' : ' ');
  printf("%d\n", n - 1);
  for (int i = 0; i <= n - 1; i++)
    printf("%d%c", ans2[n][i], (i == (n - 1)) ? '\n' : ' ');
}