import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int[] counts = new int[n]; for (int i = 1; i < n; i++) { counts[i] += i; for (int j = 1; j * i < n; j++) { counts[j * i]--; } } TreeMap> groups = new TreeMap<>(); for (int i = 1; i < n; i++) { int value = Math.abs(counts[i] - counts[n - i]); if (!groups.containsKey(value)) { groups.put(value, new ArrayList<>()); } groups.get(value).add(i); } String result = groups.firstEntry().getValue().stream().map(x -> { return new StringBuilder().append(x).append(" ").append(n - x); }).collect(Collectors.joining("\n")); System.out.println(result); } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }