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: ###############################################################################
  
  from sys import stdout
  from bisect import bisect_left as binl
  from copy import copy, deepcopy
  from collections import defaultdict
  
  
  mod = 1
  
  
  def intin():
      input_tuple = input().split()
      if len(input_tuple) <= 1:
          return int(input_tuple[0])
      return tuple(map(int, input_tuple))
  
  
  def intina():
      return [int(i) for i in input().split()]
  
  
  def intinl(count):
      return [intin() for _ in range(count)]
  
  
  def modadd(x, y):
      global mod
      return (x + y) % mod
  
  
  def modmlt(x, y):
      global mod
      return (x * y) % mod
  
  
  def lcm(x, y):
      while y != 0:
          z = x % y
          x = y
          y = z
      return x
  
  
  def combination(x, y):
      assert x >= y
  
      if y > x // 2:
          y = x - y
  
      ret = 1
  
      for i in range(0, y):
          j = x - i
          i = i + 1
  
          ret = ret * j
          ret = ret // i
  
      return ret
  
  
  def get_divisors(x):
      retlist = []
      for i in range(1, int(x**0.5) + 3):
          if x % i == 0:
              retlist.append(i)
              retlist.append(x // i)
      return retlist
  
  
  def get_factors(x):
      retlist = [1]
      for i in range(2, int(x**0.5) + 3):
          while x % i == 0:
              retlist.append(i)
              x = x // i
      retlist.append(x)
      return retlist
  
  
  def make_linklist(xylist):
      linklist = {}
      for a, b in xylist:
          linklist.setdefault(a, [])
          linklist.setdefault(b, [])
          linklist[a].append(b)
          linklist[b].append(a)
      return linklist
  
  
  def calc_longest_distance(linklist, v=1):
      distance_list = {}
      distance_count = 0
      distance = 0
      vlist_previous = []
      vlist = [v]
      nodecount = len(linklist)
  
      while distance_count < nodecount:
          vlist_next = []
          for v in vlist:
              distance_list[v] = distance
              distance_count += 1
              vlist_next.extend(linklist[v])
          distance += 1
          vlist_to_del = vlist_previous
          vlist_previous = vlist
          vlist = list(set(vlist_next) - set(vlist_to_del))
  
      max_distance = -1
      max_v = None
      for v, distance in distance_list.items():
          if distance > max_distance:
              max_distance = distance
              max_v = v
  
      return (max_distance, max_v)
  
  
  def calc_tree_diameter(linklist, v=1):
      _, u = calc_longest_distance(linklist, v)
      distance, _ = calc_longest_distance(linklist, u)
      return distance
  
  
  class UnionFind:
  
      def __init__(self, n):
          self.parent = [i for i in range(n)]
  
      def root(self, i):
          if self.parent[i] == i:
              return i
          self.parent[i] = self.root(self.parent[i])
          return self.parent[i]
  
      def unite(self, i, j):
          rooti = self.root(i)
          rootj = self.root(j)
          if rooti == rootj:
              return
          if i < j:
              self.parent[rootj] = rooti
          else:
              self.parent[rooti] = rootj
  
      def same(self, i, j):
          return self.root(i) == self.root(j)
  
  
  ###############################################################################
  
  
  def main():
      n = intin()
  
      ans = [
          11,
          31,
          41,
          61,
          71,
          101,
          131,
          151,
          181,
          191,
          211,
          241,
          251,
          271,
          281,
          311,
          331,
          401,
          421,
          431,
          461,
          491,
          521,
          541,
          571,
          601,
          631,
          641,
          661,
          691,
          701,
          751,
          761,
          811,
          821,
          881,
          911,
          941,
          971,
          991,
          1021,
          1031,
          1051,
          1061,
          1091,
          1151,
          1171,
          1181,
          1201,
          1231,
          1291,
          1301,
          1321,
          1361,
          1381,
      ]
      ans = [str(i) for i in ans]
      print(" ".join(ans[:n]))
  
  
  if __name__ == "__main__":
      main()
  
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"}]