#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;

#define TT template<typename T>
#define TTF template<typename T, typename F>
#define ET(T) typename T::value_type
TT inline T sq(T x){return x*x;}
TT inline T In(){T x;cin>>x;return x;}
TT inline void Out(T&x){cout<<x;}
TT inline void sort(T&v){sort(begin(v),end(v));}
TT inline void revs(T&v){reverse(begin(v),end(v));}
TT inline void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT inline int ubnd(T&v,ET(T)&x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT inline int lbnd(T&v,ET(T)&x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF inline void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF inline void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
#undef TT
#undef TTF
#undef ET

inline void fast_io(){ios::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}

const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000;
const int N = 10001;

bool sieve[N] = {true, true};
int main()
{
  for (int i = 2; i * i < N; i++){
    if (sieve[i]) continue;
    for (int j = i * i; j < N; j += i) sieve[j] = true;
  }
  vector<int> primes;
  for (int i = 0; i < N; i++){
    if (!sieve[i]) primes.push_back(i);
  }
  int pat[N] = {};
  for (int i = 0; i < primes.size(); i++){
    int sum = 0;
    for (int j = 0; j + i < primes.size(); j++){
      sum += primes[i + j];
      if (sum < N) pat[sum]++;
    }
  }
  int n;
  while (n = in()){
    printf("%d\n", pat[n]);
  }

  return (0);
}

// priority_queue queue deque front stringstream max_element min_element insert count make_tuple