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 sys
  
  stdin = sys.stdin
  
  sys.setrecursionlimit(10**5)
  
  
  def li():
      return map(int, stdin.readline().split())
  
  
  def li_():
      return map(lambda x: int(x) - 1, stdin.readline().split())
  
  
  def lf():
      return map(float, stdin.readline().split())
  
  
  def ls():
      return stdin.readline().split()
  
  
  def ns():
      return stdin.readline().rstrip()
  
  
  def lc():
      return list(ns())
  
  
  def ni():
      return int(stdin.readline())
  
  
  def nf():
      return float(stdin.readline())
  
  
  # 半開区間[lower, upper)の素数のリストを作成する
  def make_prime_list(lower: int, upper: int) -> list:
  
      # 変数のバリデーション
      if lower < 0:
          raise ValueError("lowerは0以上でなければいけません。(lower:{})".format(lower))
  
      elif upper <= lower:
          raise ValueError(
              "upperはlowerより大きい数でなければいけません。\
                           (lower:{}, upper:{})".format(
                  lower, upper
              )
          )
  
      # 素数リストの初期化
      isPrime = [True] * upper
      primeList = []
  
      # 区間内の数字が0,1のみならここで終了
      if upper <= 2:
          return primeList
  
      # 区間内の数字に2以上のものがあるとき
      isPrime[0] = False
      isPrime[1] = False
  
      # エラトステネスの篩の処理
      n = 2
      while n**2 <= upper:
          if isPrime[n]:
              res = 2 * n
              while res < upper:
                  isPrime[res] = False
                  res += n
  
          n += 1
  
      # 区間内の素数を抽出
      for n in range(lower, upper):
          if isPrime[n]:
              primeList.append(n)
  
      return primeList
  
  
  n = ni()
  
  prime_list = make_prime_list(0, 55555)
  
  ans = []
  for prime in prime_list:
      if prime % 5 == 1:
          ans.append(prime)
  
      if len(ans) == n:
          break
  
  print(*ans)
  
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"}]