It's a very simple problem. To avoid time limit, first generate all the prime number using sieve method. Then avoid (p1,p2) and (p2,p1) check p1 in the range 1 to n/2 where n is the input and find where n-p1 is prime or not.