sicily 1259

#include "iostream"
#include "math.h"
#include "vector"
using namespace std;
int is_prime(int x);//判断一个数是否为素数
int main()
{
	int ans, count = 0;
	vector<int> v;//用一个容器来装素数
	while (cin >> ans && ans != 0)
	{
		for (int i = 2; i <= ans; i++)
			if(is_prime(i)) //判断是否为素数，如是就放进容器内
				v.push_back(i);
		int sum = 0, count = 0, size = v.size();
		for (int i = 0; i < size; i++)
		{
			sum = 0;
			for (int j = i; j < size; j++)
			{
				sum += v[j];
				if (sum == ans)
					count++;
			}
		}
		cout << count << endl;
		v.clear();
	}
	return 0;
}

int is_prime(int x)
{
	int i, m;
	if (x == 1) return 0;
	m = floor(sqrt(double (x)) + 0.5);
	for (i = 2; i <= m; i++)
		if ( x % i == 0) 
			return 0;
	return 1;
}