import java.util.Scanner; /** * Created by Admin on 2017/3/25. */ public class test01 { public static boolean IsPrime(long n){ if (n<2) return false; if (n==2) return true; if (n>2) for (long i=2;i<=(long)Math.sqrt(n);i++){ if (n%i==0) return false; } return true; } public static void main(String[] args) { Scanner scanner=new Scanner(System.in); long num=1; while(num!=-1){ num=scanner.nextLong(); if(num>=5) { for (long i = 2; i <= num/2; i++) { if (IsPrime(i) && IsPrime(num - i)) System.out.print("(" + i + "," + (num - i) + ")"); } System.out.println(); } } } }