output_description: Output N space-separated integers, denoting the elements of the set S. S must
  satisfy the following conditions :
  
    * The elements must be **distinct** positive integers not exceeding 30000.
    * The gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.
    * S is a **special** set.
  
  If there are multiple solutions, you may output any of them. The elements of S
  may be printed in any order. It is guaranteed that at least one solution exist
  under the given contraints.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: a=0
  b=0
  lists=[]
  n=int(input())
  if n>=7 and n!=19999:
      lists2=[2*j for j in range(1,15001)]
      lists3 =[3+6*k for k in range(0,5000)]
      for q in range(1,2501):
          if (n-2*q)%3==0 and 1<=(n-2*q)<=15000:
              a=(n-2*q)
              b=q
      lists=lists2[:a]+lists3[:2*b]
      print(*lists)
  elif n==3:
      lists=[2,5,63]
      print(*lists)
  elif n==4:
      lists=[2 ,5 ,20, 63]
      print(*lists)  
  elif n==5:
      lists=[2,4,6,3,9]
      print(*lists)
  elif n==6:
      lists=[2,5,20,63,70,140]
      print(*lists)
  elif n==19999:
      lists2=[2*j for j in range(1,15001)]
      lists3 =[3+6*k for k in range(0,5000)]
      lists=lists2[:14999]+lists3[:4999]
  lists.append(229)
      print(*lists)
  
problem_description: Statement
  
  Nagase is a top student in high school. One day, she's analyzing some
  properties of special sets of positive integers.
  
  She thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of **distinct**
  positive integers is called **special** if for all 1 \leq i \leq N, the gcd
  (greatest common divisor) of a_{i} and the sum of the remaining elements of S
  is **not** 1.
  
  Nagase wants to find a **special** set of size N. However, this task is too
  easy, so she decided to ramp up the difficulty. Nagase challenges you to find
  a **special** set of size N such that the gcd of all elements are 1 and the
  elements of the set does not exceed 30000.
samples: [{"input": "3", "output": "2 5 63\n    \n\n\\\\{2, 5, 63\\\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5,\ngcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the\ncriteria.\n\nNote that \\\\{2, 4, 6\\\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\n* * *"}, {"input": "4", "output": "2 5 20 63\n    \n\n\\\\{2, 5, 20, 63\\\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 +\n63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5,\n20, 63) = 1. Thus, this set satisfies all the criteria."}]