Sum of Consecutive Primes

A number $k$ is prime if and only if $k \ge 2$ and $k$ has exactly two divisors, $1$ and $k$. Two primes $k$ and $l$ are consecutive if and only if $k < l$ and there is no prime $p$ with $k < p < l$.

Given $n$, determine whether $n$ can be written as the sum of $q$ consecutive primes, where $q$ is prime.

The input consists of several test cases. Each test case is a single line containing an integer $2 \le n \le 1000000$.

The last line of the input is $n = 0$. Do not process this case.

For each test case, print one line. Print "SIM" if $n$ can be written in the required form, or "NAO" otherwise.