package main

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

func main() {
	r := bufio.NewReader(os.Stdin)
	w := bufio.NewWriter(os.Stdout)
	defer w.Flush()
	var X int
	fmt.Fscan(r, &X)
	d := make([]int, X+1)
	d[0] = 0
	for i := 1; i <= X; i++ {
		d[i] = 1
	}
	for i := 2; i <= X; i++ {
		if d[i] == 1 {
			d[i] = 2
			for j := 2 * i; j <= X; j += i {
				n := 1
				k := j
				for k % i == 0 {
					n++;
					k /= i
				}
				d[j] *= n
			}
		}
	}
	min := X
	var minpair [][2]int
	for a := 1; a <= X/2; a++ {
		b := X - a
		v := Abs(a - d[a] - b + d[b])
		if min > v {
			min = v
			minpair = make([][2]int, 0, 2)
			minpair = append(minpair, [2]int{a, b})
			if a != b {
				minpair = append(minpair, [2]int{b, a})
			}
		} else if min == v {
			minpair = append(minpair, [2]int{a, b})
			if a != b {
				minpair = append(minpair, [2]int{b, a})
			}		
		}
	}
	sort.Slice(minpair, func(i,j int) bool {return minpair[i][0] < minpair[j][0]})
	for _, pair:= range minpair {
		fmt.Fprintln(w, pair[0], pair[1])
	}
}

func Abs(x int) int {
	if x >= 0 {
		return x
	} else {
		return -x
	}
}