### PROBLEM LINK:

### DIFFICULTY:

CAKEWALK

### PREREQUISITES:

Math, Prime Numbers

### PROBLEM:

Given a number n you need to tell if 2*n can be written as some of two primes.

### EXPLANATION:

Observe that 2*n will always be an even number. According to the even Goldbach conjecture (Euler, 1742) all even numbers larger than 2 are the sum of two primes. This conjecture is unsolved for all values of n but it is solved for 10^18 or larger. In the problem the range of 2*n fits into this range. So for n=1 the output is No else the output is Yes.

### AUTHOR’S SOLUTIONS:

Author’s solution can be found here.