# eratsiev 
# Fig. 10.2 
# input: 100

import math

n = int(input("n=? "))
primes = [True]*(n+1)
p = 2
while (p * p <= n):
  if primes[p]:
    for i in range(p*p, n+1, p):
      primes[i] = False
  p += 1
count = 1
for p in range(2, n+1):
  if primes[p]:
    print(f"{p:6}", end='')
    count += 1
  if count % 10 == 0:
    print()
    count = 1