Given an integer n, return the largest prime number less than or equal to n that can be expressed as the sum of consecutive prime numbers starting from the first prime number $2$. If no such prime number exists, return $0$.

Constraints:

• $1 \leq$ n $\leq 5 \times 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.