1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 const int maxn = 10010;
 5 bool isprime[maxn];
 6 int prime[maxn];
 7 int sum[maxn];
 8 int pcnt;
 9 int n;
10 int mp[5800000];
11 void init() {
12   memset(isprime, true, sizeof(isprime));
13   memset(prime, 0, sizeof(prime));
14   pcnt = 0;
15 }
16 void getPrime() {
17     init();
18   prime[0] = prime[1] = 0;
19   for(int i = 2; i <= maxn; i++) {
20     if(isprime[i]) prime[++pcnt] = i;
21     for(int j = 1; j <= pcnt; j++) {
22           if(i * prime[j] > maxn) break;
23         isprime[i*prime[j]] = 0;
24         if(i % prime[j] == 0) break;
25     }
26   }
27 }
28 
29 int main() {
30     // freopen("in", "r", stdin);
31     // freopen("out", "w", stdout);
32     getPrime();
33     memset(sum, 0, sizeof(sum));
34     sum[0] = prime[0];
35     for(int i = 1; i < pcnt; i++) sum[i] = sum[i-1] + prime[i];
36     memset(mp, 0, sizeof(mp));
37     for(int i = 0; i < pcnt; i++) {
38         for(int j = i; j < pcnt; j++) {
39             mp[sum[j]-sum[i]]++;
40         }
41     }
42     while(~scanf("%d", &n) && n) {
43         printf("%d\n", mp[n]);
44     }
45     return 0;
46 }