output_description: Print N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: import math
  from itertools import combinations
  import sys
  def primes(x):
      if x < 2: return []
   
      primes = [i for i in range(x)]
      primes[1] = 0 # 1は素数ではない
   
      # エラトステネスのふるい
      for prime in primes:
          if prime > math.sqrt(x): break
          if prime == 0: continue
          for non_prime in range(2 * prime, x, prime): primes[non_prime] = 0
   
      return [prime for prime in primes if prime != 0]
    
  def is_prime(x):
      if x < 2: return False # 2未満に素数はない
      if x == 2 or x == 3 or x == 5: return True # 2,3,5は素数
      if x % 2 == 0 or x % 3 == 0 or x % 5 == 0: return False # 2,3,5の倍数は合成数
   
      # ためし割り: 疑似素数(2でも3でも5でも割り切れない数字)で次々に割っていく
      prime = 7
      step = 4
      while prime <= math.sqrt(x):
          if x % prime == 0: return False
   
          prime += step
          step = 6 - step
   
      return True
    
  prime_nums = primes(55555)
  prime_list = prime_nums[:5]
  prime_remain = prime_nums[5:]
  N = int(input())
  for p in prime_remain:
    prime_l = prime_list + [p]
    combs = list(combinations(prime_l, 5))
    if not True in [is_prime(sum(c)) for c in combs]:
      prime_list = [p for p in prime_l]
    
    # print(len(prime_list), p)
    if len(prime_list) == N:
      for p in prime_list:
        print(p, end = ' ')
      break
      # sys.exit()
  import math
  from itertools import combinations
  import sys
  def primes(x):
      if x < 2: return []
  
      primes = [i for i in range(x)]
      primes[1] = 0 # 1は素数ではない
  
      # エラトステネスのふるい
      for prime in primes:
          if prime > math.sqrt(x): break
          if prime == 0: continue
          for non_prime in range(2 * prime, x, prime): primes[non_prime] = 0
  
      return [prime for prime in primes if prime != 0]
    
  def is_prime(x):
      if x < 2: return False # 2未満に素数はない
      if x == 2 or x == 3 or x == 5: return True # 2,3,5は素数
      if x % 2 == 0 or x % 3 == 0 or x % 5 == 0: return False # 2,3,5の倍数は合成数
  
      # ためし割り: 疑似素数(2でも3でも5でも割り切れない数字)で次々に割っていく
      prime = 7
      step = 4
      while prime <= math.sqrt(x):
          if x % prime == 0: return False
  
          prime += step
          step = 6 - step
  
      return True
    
  prime_nums = primes(55555)
  ans = ''
  for p in prime_nums:
    if str(p)[-1] == '1':
      ans += str(p) + ' '
  print(ans)
  
  '''
  prime_list = prime_nums[:5]
  prime_remain = prime_nums[5:]
  N = int(input())
  for p in prime_remain:
    prime_l = prime_list + [p]
    combs = list(combinations(prime_l, 5))
    if not True in [is_prime(sum(c)) for c in combs]:
      prime_list = [p for p in prime_l]
    
    # print(len(prime_list), p)
    if len(prime_list) == N:
      for p in prime_list:
        print(p, end = ' ')
      break
      # sys.exit()
problem_description: Statement
  
  Print a sequence a_1, a_2, ..., a_N whose length is N that satisfies the
  following conditions:
  
    * a_i (1 \leq i \leq N) is a prime number at most 55 555.
    * The values of a_1, a_2, ..., a_N are all different.
    * In every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.
  
  If there are multiple such sequences, printing any of them is accepted.
samples: [{"input": "5", "output": "3 5 7 11 31\n    \n\nLet us see if this output actually satisfies the conditions.  \nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime\nnumbers.  \nThe only way to choose five among them is to choose all of them, whose sum is\na_1+a_2+a_3+a_4+a_5=57, which is a composite number.  \nThere are also other possible outputs, such as `2 3 5 7 13`, `11 13 17 19 31`\nand `7 11 5 31 3`.\n\n* * *"}, {"input": "6", "output": "2 3 5 7 11 13\n    \n\n  * 2, 3, 5, 7, 11, 13 are all different prime numbers.\n  * 2+3+5+7+11=28 is a composite number.\n  * 2+3+5+7+13=30 is a composite number.\n  * 2+3+5+11+13=34 is a composite number.\n  * 2+3+7+11+13=36 is a composite number.\n  * 2+5+7+11+13=38 is a composite number.\n  * 3+5+7+11+13=39 is a composite number.\n\nThus, the sequence `2 3 5 7 11 13` satisfies the conditions.\n\n* * *"}, {"input": "8", "output": "2 5 7 13 19 37 67 79"}]