//ISC 2002
public class TwinPrimes
{   public static void main(String args[])
    {   int n=12;//input 
        int gap=1;
        if(isPrime(n-1) && isPrime(n+1))
        { System.out.println((n-1)+" "+(n+1));
        }
        else if(isPrime(n) && isPrime(n-2))
        { System.out.println((n-2)+" "+(n));
        }
        else if(isPrime(n) && isPrime(n+2))
        { System.out.println((n)+" "+(n+2));
        }
        else
        {   while(true)
            {   if(isPrime(n-gap) && isPrime(n-gap-2))
                { System.out.println((n-gap-2)+" "+(n-gap));
                    break;
                }
                else if(isPrime(n+gap) && isPrime(n+gap+2))
                { System.out.println((n+gap)+" "+(n+gap+2));
                    break;
                }
                gap++;
            }
        }
    }//fun    
    private static boolean isPrime(int n)
    {   if(n<=1) return false;
        for(int i=2; i<n; i++)
        {   if(n%i==0) return false;
        }
        return true;
    }
}