#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

const int MAX_N =10010;
int prime[MAX_N+500];//i番目の素数
bool is_prime[MAX_N+100];//is_prime[i]がtrueならiは素数

//n以下の素数の数を返す
int sieve(int n){
	int p = 0;
	for(int i = 0;i <=n;i++){
		is_prime[i] =true;
	}
	is_prime[0] = false;
	is_prime[1] = false;
	for(int i = 2;i <=n;i++){
		if(is_prime[i]){
			prime[p++] = i;
			for(int j = 2*i;j <=n;j +=i){
				is_prime[j] =false;
			}
		}
	}
	return p;
}
int n;
int main(){
	int kkkk = sieve(10010);
	while(cin>>n){
		if(n==0){
			break;
		}
		int s = 0;
		int t = 0;
		int sum = 2;
		int ans = 0;
		do{
			if(sum > n){
				sum -=prime[s++];
			}
			if(sum <n){
				sum +=prime[++t];
			}
			if(sum ==n){
				ans++;
				sum -=prime[s++];
			}
		}while(prime[t]<=n&&s !=t);
		cout <<ans<<endl;
	}
	return 0;
}