2739

/*
	简单的数学题
*/

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef __int64 LL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)

#define Z(a,b) ((a)<<(b))
#define Y(a,b) ((a)>>(b))

const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
	return TMIN(TMIN(x,y),z);
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}


// code begin
int N;
bool P[10001];
int stk[10001],top;
int DP[10001];
int main()
{
	read;
	write;
	
	memset(P,0,sizeof(P));
	for(int i=2;i*2<=10000;i++)
	{
		if(!P[i])
		{
			for(int j=i+i;j<=10000;j+=i)
			{
				P[j] = true;
			}
		}
	}
	top = 0;
	for(int i=2;i<=10000;i++)
	{
		if(!P[i])
			stk[top++] = i;
	}
	memset(DP,0,sizeof(DP));
	int sum;
	for(int i=0;i<top;i++)
	{
		sum = 0;
		for(int j=i;j<top;j++)
		{
			sum += stk[j];
			if(sum>10000) break;
			DP[sum]++;
		}
	}
	while(scanf("%d",&N)!=-1)
	{
		if(N==0) break;
		printf("%d\n",DP[N]);
	}
	return 0;
}