import java.util.Scanner;
public class Testa {
public static void main(String[] args) {
System.out.println("请输入n:(代表求多少个连续的合数)");
Scanner reader=new Scanner(System.in);
int n=reader.nextInt();
g(n);
}
// 试商判别法
public static boolean f(int l) {
if (l <= 1) {
return false;
}
int max = (int) Math.sqrt(l);
for (int i = 2; i < max + 1; i++) {
if (l % i == 0) {
return false;
}
}
return true;
}
//符合条件的数
public static void g(int n){
int min=2;
int max=3;
int cha=max-min-1;
int temp=0;
while(cha<n){
min=max;
temp=max+2;
boolean ok=f(temp);
while(ok!=true)
{
temp=temp+2;
ok=f(temp);
}
max=temp;
cha=max-min-1;
}
int cha1=cha-n;
System.out.println((min+1)+" "+(max-1-cha1));
}
}