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: N = int(input())
  dp = [True] * 55556
  dp[0] = False
  dp[1] = False
  for i in range(2, 55556):
      if dp[i]:
          h = i + i
          while h < 55556:
              dp[h] = False
              h += i
  ans = []
  for i in range(55556):
      if dp[i] and i % 5 == 1:
          ans.append(i)
  for a in ans[:N]:
      print(a, end=" ")
  
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"}]