import scala.collection.mutable.ArrayBuffer

object Scanner {
  private val buf = new Array[Byte](1024); private var ptr = 0; private var len = 0
  @inline private def isPrintableChar(c: Int): Boolean = 33 <= c && c <= 126
  @inline private def hasNextByte(): Boolean =
    if (ptr >= len) { ptr = 0; len = System.in.read(buf); len > 0 } else { true }
  @inline private def hasNext(): Boolean = {
    while (hasNextByte() && !isPrintableChar(buf(ptr))) ptr += 1
    hasNextByte()
  }
  @inline private def readByte(): Byte =
    if (hasNextByte()) { val res = buf(ptr); ptr += 1; res } else { -1 }
  def next(): String = {
    if(!hasNext()) ???
    val sb = new StringBuilder; var b = readByte()
    while (isPrintableChar(b)) { sb.append(b.toChar); b = readByte() }
    sb.toString
  }
  def nextInt(): Int = {
    val n = nextLong()
    if (n < Int.MinValue || Int.MaxValue < n) ???
    n.toInt
  }
  def nextLong(): Long = {
    if(!hasNext()) ???
    var minus = false; var b = readByte()
    if (b == '-') { minus = true; b = readByte() }
    def go (b: Byte, n: Long = 0): Long =
      if ('0' <= b && b <= '9') { go(readByte(), n * 10 + b - '0') }
      else if (minus) { -n } else { n }
    go(b)
  }
  def nextDouble(): Double = next.toDouble
}

object Main extends App{
  val n = Scanner.nextInt()
  var primesMemo = Array.fill(55555*n-2)(true)
  (2 to 55555*n/2).foreach(i => {
    primesMemo(2*i-3) = false
  })
  (3 to 55555*n).foreach(i => {
    if (primesMemo(i-3)){
      (2 to 55555*n/i).foreach(j=>{
        primesMemo(i*j-3) = false
      })
    }
  })
  val primes = 2 +: primesMemo.zipWithIndex.filter(_._1).map(_._2+3)
  val primesMap = primes.map(i=>(i,true)).toMap
  val primes2 = primes.filter(_<=55555)
  val bk = new scala.util.control.Breaks
  import bk.{breakable,break}
  breakable {
    primes2.combinations(n).foreach(comb1=>{
      if (comb1.combinations(5).forall(comb2=>{
        val sum = comb2.sum
        !primesMap.getOrElse(sum,false)
      })){
        println(comb1.mkString(" "))
        break()
      }
    })
  }
}