package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	if n == 1 {
		fmt.Fprintln(writer, 1)
		return
	}
	n--
	mx := int(1e6)
	era := make([]int, mx)
	for i := 2; i < mx; i++ {
		for j := i; j < mx; j += i {
			if era[j] == 0 {
				era[j] = i
			}
		}
	}
	pp := make([]int64, 0)
	for i := 100001; i < mx && len(pp) < 10; i++ {
		if era[i] == i {
			pp = append(pp, int64(i))
		}
	}

	l := make(ll, 0)
	for i := 0; i < 10; i++ {
		for j := 0; j < 10; j++ {
			l = append(l, pp[i]*pp[j])
		}
	}
	sort.SliceStable(l, l.less)
	c := newCompress(l)
	for i := 0; i < len(l); i++ {
		if c.get(l[i]) == n-1 {
			fmt.Fprintln(writer, l[i])
			return
		}
	}
}

type ll []int64

func (l ll) less(i, j int) bool {
	return l[i] < l[j]
}

type compress map[int64]int

func newCompress(aa []int64) compress {
	n := len(aa)
	bb := make([]int64, n)
	copy(bb, aa)
	sort.SliceStable(bb, func(i, j int) bool {
		return bb[i] < bb[j]
	})
	c := compress{}
	l := 0
	i := 0
	for r := 0; r < n; r++ {
		for r > l && bb[r] != bb[l] {
			l++
		}
		if r == l {
			c[bb[l]] = i
			i++
		}
	}
	return c
}
func (c compress) get(x int64) int {
	return c[x]
}