Byteazar is exploring some generalization of the famous Goldbach problem. He takes two integers and and counts the number of A \le X \le B such as can be represented as the sum of two primes (not necessarily different). Note that 1 cannot be considered as prime.
Given and , help him to do that calculation.
Input data contains two integers and (2 \le A \le B \le 10^{12}), B-A \le 4 \cdot 10^4.
Print one integer — the number of A \le X \le B such as can be represented as the sum of two primes.
Nümunə 1
Nümunə 2