> http://blog.csdn.net/luckcircle/article/details/53248376
#include<stdio.h>
#include<string.h>
const int MAX=10005;
bool isprime[10005];
int prime[1230],top=0,num[10005];
void init(){
	memset(isprime,true,sizeof(isprime));
	for(int i=2;i<MAX;i++){
		if(isprime[i]){
			prime[top++]=i;
			for(int j=i*2;j<MAX;j+=i){
				isprime[j]=false;
			}
		}
	}
}
void solve(){
	int sum;
	memset(num,0,sizeof(num));
	for(int i=0;i<top;i++){
		sum=0;
		for(int j=i;j<top;j++){
			sum=sum+prime[j];
			if(sum>10000){
				break;
			}
			num[sum]++;
		}
	}
}
int main(){
	int n;
	init();
	solve();
	while(scanf("%d",&n)!=EOF&&n){
		printf("%d\n",num[n]);
	}
}