def solve(Winput,Woutput):
    P = len(Winput)
    N = len(Winput[0])
    for a in range(P):
        for b in range(P):
            M = [max(0,Winput[a][i] + Winput[b][i]) for i in range(N)]
            scores = []
            for i in range(P):
                tmp = 0.0
                for j in range(N):
                    tmp += M[j]*Woutput[i][j]
                scores.append(tmp)
            # print(a, b, M, scores.index(max(scores)), scores)
            if not (scores.index(max(scores)) == (a+b)%P and scores.count(max(scores)) == 1) :
                print(a, b)

p = int(input())
n = 4
Winput = [[] for _ in range(4)]
Winput[0] = [i for i in range(p)]
Winput[1] = [i - p / 2 for i in range(p)]
Winput[2] = [i - p / 2 + 0.5 for i in range(p)]
Winput[3] = [0.5 for i in range(p)]
Winput = [[Winput[b][a] for b in range(n)] for a in range(p)]
Woutput = [[] for _ in range(4)]
Woutput[0] = [2 * i / 100 for i in range(p)]
Woutput[1] = [2*i*p / 100 for i in range(p)]
Woutput[2] = [-Woutput[1][i] for i in range(p)]
Woutput[3] = [(p * p - i * i) / 100 for i in range(p)]
Woutput = [[Woutput[b][a] for b in range(n)] for a in range(p)]

print(4)
for x in Winput :
    print(" ".join(map(str, x)))
print()
for y in Woutput :
    print(" ".join(map(str, y)))
solve(Winput, Woutput)