# cycle1
# inputs: 5 or 7 or 9 (p.224 table)

n = int(input("n=? "))
# initialize n-tuple [1,1,0,0...]
xs = [0]*n
xs[0] = 1 
xs[1] = 1
print(*xs)

c = 0
while True:
  while True:
    c += 1
    t = xs[0]
    for i in range(n-1):
      xs[i] = xs[i] ^ xs[i+1] 
      # xor rather than abs diff
    xs[n-1] = xs[n-1] ^ t
    print(*xs)
    if (xs[0] + xs[1]) == 2: 
      # same pattern at start
      break
  if sum(xs[2:n]) == 0:
    # same pattern in rest
    break
print("cycle length c =", c)